1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;

#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define debug false

const int MAXN = 100 * 1000 + 17;
vector<int> graf[MAXN];
vector<pii> kraw;
int kol[MAXN];
int ojc[MAXN];
int roz[MAXN];
vector<int> kand;
int ile[MAXN];
map<int, int> wyst[MAXN];
set<int> s;
vector<int> jakie[MAXN];
bool wziete[MAXN];
int ojc2[MAXN];
int n, m, k;

int findd(int x) {
    if (ojc[x] != x){
        ojc[x] = findd(ojc[x]);
    }
    return ojc[x];
}

void unionn(int x, int y) {
    x = findd(x);
    y = findd(y);

    if (x == y) {
        return;
    }

    if (roz[x] > roz[y]) {
        swap(x, y);
    }
    roz[y] += roz[x];
    ojc[x] = y;
}

int findd2(int x) {
    if (ojc2[x] != x){
        ojc2[x] = findd2(ojc2[x]);
    }
    return ojc2[x];
}

void czysc () {
    kraw.clear();
    kand.clear();
    s.clear();
    for (int i = 1; i <= n; i ++) {
        graf[i].clear();
        wyst[i].clear();
        wziete[i] = 0;
    }
    for (int i = 1; i <= k; i ++) {
        jakie[i].clear();
        ile[i] = 0;
    }
}

void unionn2 (int x, int y) {
    if (int(wyst[x].size()) < int(wyst[y].size())) {
        swap(x, y);
    }
    for (auto el : wyst[y]) {
        int v = wyst[x][el.st];
        if (v == 0) {
            wyst[x][el.st] = el.nd;
        } else {
            if (findd(el.nd) != findd(v)) {
                ile[kol[v]] --;
                if (ile[kol[v]] == 1) {
                    kand.pb(kol[v]);
                }
                unionn(el.nd, v);
            }
        }
    }
    ojc2[y] = x;
}

void rozw () {
    cin >> n >> m >> k;

    for (int i = 1; i <= n; i ++) {
        cin >> kol[i];
    }

    int a, b;
    for (int i = 0; i < m; i ++) {
        cin >> a >> b;
        kraw.pb({a, b});
    }

    for (int i = 1; i <= n; i ++) {
        roz[i] = 1;
        ojc[i] = i;
    }

    for (auto x : kraw) {
        if (kol[x.st] == kol[x.nd]) {
            unionn(x.st, x.nd);
        }
    }

    for (auto x : kraw) {
        if (kol[x.st] != kol[x.nd]) {
            graf[findd(x.st)].pb(findd(x.nd));
            graf[findd(x.nd)].pb(findd(x.st));
        }
    }

    for (int i = 1; i <= n; i ++) {
        s.insert(findd(i));
    }

    for (auto x : s) {
        ile[kol[x]] ++;
        jakie[kol[x]].pb(x);
    }

    int wyn = 0;

    for (int i = 1; i <= k; i ++) {
        if (ile[i] == 1) {
            kand.pb(i);
        }
        if (ile[i] == 0) {
            wyn ++;
        }
    }

    for (auto x : s) {
        ojc[x] = x;
        roz[x] = 1;
        ojc2[x] = x;
    }

    while (!kand.empty()) {
        wyn ++;
        int x = kand.back();
        kand.pop_back();

        for (auto v : jakie[x]) {
            wziete[v] = 1;
            for (auto u : graf[v]) {
                if (wziete[u]) {
                    if (findd2(v) != findd2(u)) {
                        unionn2(findd2(v), findd2(u));
                    }

                } else {
                    int co = wyst[findd2(v)][kol[u]];
                    if (co == 0) {
                        wyst[findd2(v)][kol[u]] = u;
                    } else {
                        if (findd(co) != findd(u)) {
                            ile[kol[u]] --;
                            if (ile[kol[u]] == 1) {
                                kand.pb(kol[u]);
                            }
                            unionn(co, u);
                        }
                    }
                }
            }
        }

    }

    czysc();

    if (wyn == k) {
        cout << "TAK\n";
    } else {
        cout << "NIE\n";
    }
}

int main () {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t;
    cin >> t;

    while (t --) {
        rozw();
    }

    return 0;
}