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
#include <bits/stdc++.h>
using namespace std;
#define TF(i, p, q) for(int i = (p); i <= (q); ++i)
#define TR(i, q, p) for(int i = (q); i >= (p); --i)
#define V vector
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define th third
#define rz resize
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()
#define sz(V) (int)(V.size())
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
typedef pair<int,int> ii;
typedef queue<int> qi;
typedef queue<ii> qii;
typedef long long ll; 
typedef vector<int> vi;
typedef vector<vector<int>>vvi;
typedef vector<vector<bool>>vvb;
typedef vector<bool> vb;
typedef vector<ii> vii;
constexpr int inf = 1e9 + 9, mx = 1e5 + 9;
int findx(int x, vi& rep){
    if(rep[x] == x) return x;
    else rep[x] = findx(rep[x], rep);
    return rep[x];
}
void onion(int a, int b, vi& rep, vvi& squad){
    int fa = findx(a, rep), fb = findx(b, rep);
    if(fa == fb) return;
    if(sz(squad[fa]) > sz(squad[fb])) swap(fa, fb);
    rep[fa] = fb;
    for(int v : squad[fa]) squad[fb].pb(v);
    squad[fa].clear();
}
bool simpleonion(int a, int b, vi& rep){
    int fa = findx(a, rep), fb = findx(b, rep);
    if(fa == fb) return false;
    rep[fa] = fb;
    return true;
}
vi onii(int a, int b, vi& rep, V<unordered_map<int,int>>& cps, vvi& colrep, vi& tc, vb& mark){
    int fa = findx(a, rep); int fb = findx(b, rep);
    vi nmarked;
    if(fa == fb) return nmarked;
    if(sz(cps[fa]) > sz(cps[fb])) swap(fa, fb);
    rep[fa] = fb;
    for(auto [key, val] : cps[fa]){
        if(cps[fb].find(key) == cps[fb].end()){
            cps[fb][key] = val;
            continue;
        }
        bool waschanged = simpleonion(cps[fb][key], val, colrep[key]);
        tc[key] -= waschanged;
        if(!tc[key] and !mark[key]){
            mark[key] = 1;
            nmarked.pb(key);
        }
    }
    cps[fa].clear();
    return nmarked;
}
vi noncom(int a, int b, int ck, vi& rep, vi& srep, vi& rpid, V<unordered_map<int,int>>& cps, vvi& colrep, vi& tc, vb& mark){
    int fa = findx(a, srep); int fb = findx(b, srep);
    vi nmarked;
    if(fa == fb) return nmarked;
    if(cps[fa].find(ck) == cps[fa].end()){
        cps[fa][ck] = colrep[ck][rpid[findx(b, rep)]];
        return nmarked;
    }
    else{
        bool waschanged = simpleonion(cps[fa][ck], colrep[ck][rpid[findx(b, rep)]], colrep[ck]);
        tc[ck] -= waschanged;
        if(!tc[ck] and !mark[ck]){
            mark[ck] = 1;
            nmarked.pb(ck);
        }
    }
    return nmarked;
}
vi minv(mx, inf);
void solve(){
    int n, m, k; cin >> n >> m >> k;
    vi rep(n+1); vi rcl(n+1); vi cnt(k+1); vi rpid(n+1);
    vb mark(k+1);
    vi srep(n+1);
    vvi squad(n+1); vvi graph(n+1); vvi rvc(k+1); vb onq(n+1);
    vvi colrep(k+1);
    V<unordered_map<int,int>>cps(n+1);
    vvb cols(k+1);
    TF(i, 1, n){
        cin >> rcl[i];
        rep[i] = i;
        srep[i] = i;
        squad[i].pb(i);
    }
    TF(i, 1, m){
        int a, b; cin >> a >> b;
        graph[a].pb(b);
        graph[b].pb(a);
        if(rcl[a] == rcl[b]){
            onion(a, b, rep, squad);
        }
    }
    V<set<int>>dcs(k+1);
    TF(i, 1, n){
        int a = findx(i, rep);
        dcs[rcl[i]].insert(a);
    }
    TF(i, 1, k){
        for(int v : dcs[i]){
            rpid[v] = cnt[i];
            rvc[i].pb(v);
            colrep[i].pb(cnt[i]);
            cps[findx(v, srep)][i] = cnt[i];
            cnt[i]++;
            cols[i].pb(0);
        }
    }
    queue<int>q;
    TF(i, 1, k){
        if(cnt[i] == 0){
            mark[i] = 1;
        }
        else if(cnt[i] == 1){
            cnt[i] = 0;
            cols[i][0] = 1;
            mark[i] = 1;
            for(int v : squad[rvc[i][0]]){
                q.push(v);
                onq[v] = 1;
            }
        }
        else cnt[i]--;
    }
    while(!q.empty()){
        int u = q.front(); q.pop();
        for(int v : graph[u]){
            if(onq[v]){
                vi nx = onii(u, v, srep, cps, colrep, cnt, mark);
                for(int ccc : nx){
                    for(int cg : rvc[ccc]){
                        for(int g : squad[cg]){
                            q.push(g);
                            onq[g] = 1;
                        }
                    }
                }
                continue;
            }
            int x = findx(v, rep);
            vi nx = noncom(u, x, rcl[x], rep, srep, rpid, cps, colrep, cnt, mark);
            for(int ccc : nx){
                for(int cg : rvc[ccc]){
                    for(int g : squad[cg]){
                        q.push(g);
                        onq[g] = 1;
                    }
                }
            }
            /*int x = findx(v, rep);
            int root = findx(u, srep);
            if(cps[root].find(rcl[x]) == cps[root].end()){
                cps[root][rcl[x]] = findx(rpid[x], colrep[rcl[x]]);
            }
            else{
                bool waschanged = simpleonion(cps[root][rcl[x]], findx(rpid[x], colrep[rcl[x]]), colrep[rcl[x]]);
                cnt[rcl[x]] -= waschanged;
                if(!cnt[rcl[x]]){
                    for(int cg : rvc[rcl[x]]){
                        for(int g : squad[cg]){
                            q.push(g);
                            onq[g] = 1;
                        }
                    }
                }
            }*/
        }
    }
    TF(i, 1, k){
        if(cnt[i] or !mark[i]){
            cout << "NIE" << endl;
            return;
        }
    }
    cout << "TAK" << endl;
    return;
}
int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); int t; cin >> t; while(t--) solve();
}