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
#include <bits/stdc++.h>
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

#define DEBUG
#ifdef DEBUG
template<typename T1,typename T2>auto& operator<<(ostream&o,pair<T1,T2>a){return o<<"("<<a.first<<", "<<a.second<<")";}
template<typename T,size_t...I>void pt(ostream&o,T t,index_sequence<I...>){o<<"(";(...,(o<<(I?", ":"")<< get<I>(t)));o<<")";}
template<typename...A>auto& operator<<(ostream&o,tuple<A...>t){pt(o,t,index_sequence_for<A...>{});return o;}
template<typename T,typename O>auto& operator<<(O&o,T a){o<<"{";for(auto b:a)o<<b<<", ";return o<<"}";}
#define db(x...) cerr << "\033[92m" << "[" #x "]: ", [](auto... args) { ((cerr << args << ", "),...) << "\033[0m" << "\n"; }(x)
#else
#define db(...)
#endif

#define sz(x) ((int)(x).size()) 
#define all(x) (x).begin(), (x).end()
#define F first
#define S second

template<class T>
using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using vi = vector<int>;

mt19937 mrand(random_device{}());
ll rnd(ll l, ll r) { return l + mrand() % (r - l + 1);}

ll n, m, k;
vector<ll> color, cnt, crank;
vector<pll> parent;
vector<vector<ll>> adj, verts;

void make_set(ll v) {
    parent[v] = make_pair(v, 0);
    crank[v] = 0;
}

pll find_set(ll v) {
    if (v != parent[v].F) {
        ll len = parent[v].S;
        parent[v] = find_set(parent[v].F);
        parent[v].S += len;
    }
    return parent[v];
}

void union_sets(ll a, ll b) {
    a = find_set(a).F;
    b = find_set(b).F;
    ll o1 = a, o2 = b;
    if (a == b) return;
    if (crank[a] < crank[b])
        swap(a, b);
    parent[b] = make_pair(a, 1);
    if (crank[a] == crank[b])
        crank[a]++;
}

bool same_set(int a, int b) {
    a = find_set(a).first;
    b = find_set(b).first;
    if(a == b) return true;
    return false;
}

int main() {
    cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);

    ll t;
    cin >> t;
    while(t--) {
        cin >> n >> m >> k;
        adj = vector<vector<ll>>(n);
        verts = vector<vector<ll>>(k);
        color = crank = vector<ll>(n);
        cnt = vector<ll>(k);
        parent = vector<pll>(n);

        vector<pll> edges;
        for(ll i = 0 ; i < n ; ++i) {
            cin >> color[i];
            color[i]--;
            cnt[color[i]]++;
            verts[color[i]].emplace_back(i);
            make_set(i);
        }
        
        for(ll i = 0 ; i < m ; ++i) {
            ll a, b;
            cin >> a >> b;
            a--; b--;
            adj[a].emplace_back(b);
            adj[b].emplace_back(a);
        }

        for(ll v = 0 ; v < n ; ++v) {
            for(auto u : adj[v]) {
                if(color[v] != color[u] || same_set(v, u)) continue;
                cnt[color[v]]--;
                union_sets(v, u);
            }
        }

        queue<ll> q;

        for(ll i = 0 ; i < k ; ++i) {
            if(cnt[i] < 2) q.emplace(i);
        }

        vector<map<ll,ll>> mp(n);
        vector<bool> visited(k, false);
        while(!q.empty()) {
            ll col = q.front(); q.pop();
            if(visited[col]) continue;
            visited[col] = true;

            for(auto v : verts[col]) {
                for(auto u : adj[v]) {
                    if(cnt[color[u]] < 2 && !same_set(u, v)) {
                        ll vp = find_set(v).F, vq = find_set(u).F;
                        union_sets(v, u);
                        if(find_set(v).F == vq) swap(vq, vp); 
                        for(auto [c, rep] : mp[vq]) {
                            if(mp[vp][c] != 0) {
                                if(!same_set(mp[vq][c]-1, mp[vp][c]-1)) {
                                    cnt[c]--;
                                    union_sets(mp[vq][c]-1, mp[vp][c]-1);
                                }
                                if(cnt[c] < 2) q.emplace(c);
                            } else mp[vp][c] = rep;
                        }
                    }

                    ll parv = find_set(v).F;

                    if(mp[parv][color[u]] == 0) mp[parv][color[u]] = u+1;
                    else {
                        if(!same_set(mp[parv][color[u]]-1, u)) cnt[color[u]]--;
                        union_sets(mp[parv][color[u]]-1, u);
                        if(cnt[color[u]] < 2) q.emplace(color[u]);
                    }
                }
            }
        }

        bool f = true;
        for(auto x : cnt) if (x > 1) f = false;

        if(f) cout << "TAK\n";
        else cout << "NIE\n";
    }

    return 0;
}