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
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
template <class T>
using Ve = vector<T>;
#define ALL(v) (v).begin(), (v).end()
#define pii pair<ll, ll>
#define rep(i, a, b) for(ll i = (a); i <= (b); ++i)
#define per(i, a, b) for(ll i = (a); i >= (b); --i)
#define pb push_back
bool Mbe;
ll read() {
    ll x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}
void write(ll x) {
    if(x < 0) putchar('-'), x = -x;
    if(x > 9) write(x / 10);
    putchar(x % 10 + '0');
}
const ll N = 2e5 + 9;
ll n, m, K, a[N], bid[N];
Ve<ll> to[N], va[N], es[N], vp[N];
bool vis[N];
Ve<ll> cid[N];
struct DSU {
    Ve<ll> fa; ll sz;
    DSU(ll n = 0) { fa.resize(n + 1); iota(ALL(fa), 0ll); sz = n; }
    ll find(ll x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
    bool merge(ll i, ll j) {
        ll fi = find(i), fj = find(j);
        if(fi != fj) { fa[fi] = fj; sz--; return 1; }
        return 0;
    }
} pds[N];
void solve() {
    ll n = read(), m = read(), K = read();
    rep(i, 0, n + 1) to[i].clear();
    rep(i, 0, K + 1) va[i].clear();
    rep(i, 0, n + 1) bid[i] = 0;
    rep(i, 1, n) {
        a[i] = read();
        va[a[i]].pb(i);
    }
    rep(i, 1, m) {
        ll u = read(), v = read();
        to[u].pb(v), to[v].pb(u);
    }
    Ve<ll> vq = {0};
    rep(i, 0, K + 1) cid[i].clear(), vis[i] = 0;
    ll C = 0;
    rep(p, 1, K) {
        for(ll x : va[p]) {
            if(!bid[x]) {
                C++, bid[x] = C, cid[p].pb(C), vq.pb(p);
                queue<ll> qu; qu.push(x);
                while(!qu.empty()) {
                    ll u = qu.front(); qu.pop();
                    for(ll v : to[u]) {
                        if(a[v] == p && !bid[v]) bid[v] = C, qu.push(v);
                    }
                }
            }
        }
    }
    rep(i, 0, C + 1) es[i].clear();
    rep(u, 1, n) {
        for(ll v : to[u]) {
            if(bid[u] != bid[v]) es[bid[u]].pb(bid[v]);
        }
    }
    rep(i, 1, C) {
        sort(ALL(es[i]));
        es[i].erase(unique(ALL(es[i])), es[i].end());
    }
    DSU ds(C);
    rep(i, 1, K) pds[i] = DSU(cid[i].size());
    Ve<map<ll, ll>> mp(K + 1);
    rep(i, 0, C + 1) vp[i].clear();
    rep(i, 0, K + 1) vis[i] = 0;
    queue<ll> q;
    auto Add = [&](ll p, ll idx, ll r) {
        if(vis[p]) return;
        if(mp[p].count(r)) {
            if(pds[p].merge(mp[p][r], idx) && pds[p].sz == 1) vis[p] = 1, q.push(p);
        } else {
            mp[p][r] = idx; vp[r].pb(p);
        }
    };
    auto Mrg = [&](ll r1, ll r2) {
        r1 = ds.find(r1); r2 = ds.find(r2);
        if(r1 == r2) return r1;
        if(vp[r1].size() < vp[r2].size()) swap(r1, r2);
        for(ll p : vp[r2]) Add(p, mp[p][r2], r1);
        ds.fa[r2] = r1; vp[r2].clear();
        return r1;
    };
    rep(i, 1, K) {
        if(cid[i].size() <= 1) vis[i] = 1, q.push(i); 
    }
    // rep(i, 1, K) cout << cid[i].size() << " ";
    // cout << endl;
    ll cnt = 0;
    while(!q.empty()) {
        ll u = q.front(); q.pop();
        cnt++;
        ll rt = 0;
        for(ll c : cid[u]) {
            if(!rt) rt = ds.find(c);
            else rt = Mrg(rt, c);
        }
        for(ll c : cid[u]) {
            for(ll nb : es[c]) {
                ll tp = vq[nb];
                if(vis[tp]) rt = Mrg(rt, nb);
                else {
                    ll idx = lower_bound(ALL(cid[tp]), nb) - cid[tp].begin();
                    Add(tp, idx, ds.find(rt));
                }
            }
        }
    }
    if(cnt == K) puts("TAK");
    else puts("NIE");
}
bool Med;
int main() {
    cerr << fabs(&Med - &Mbe) / 1048576.0 << "MB\n";
    ll T = read();
    while(T--) solve();
    cerr << "\n" << clock() * 1.0 / CLOCKS_PER_SEC * 1000 << "ms\n";
    return 0;
}