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
#include "bits/stdc++.h"
using namespace std;

int const N = 1e5+5;
queue <int> q;

struct Party{
    int cnt[N], rep[N];
    void init(int k){
        for(int i = 1; i <= k; ++i) cnt[i] = rep[i] = 0;
    }
    void add(int party, int x){
        cnt[party]++;
        rep[party] = x;
    }
} parties;

struct DSU{
    int parent[N], amt[N];
    void init(int n){
        for(int i = 1; i <= n; ++i) parent[i] = i, amt[i] = 0;
    }
    int find(int x){
        return parent[x] == x ? x : parent[x] = find(parent[x]);
    }
    void unite(int x, int y) {
        x = find(x); y = find(y);
        if(x == y) return;
        if(amt[x] < amt[y]) swap(x, y);
        parent[y] = x;
        amt[x] += amt[y];
    }
} dsu1;

struct Block_DSU{
    int parent[N], party[N];
    set <int> v[N];
    bool universal[N];
    map<int,int> umap[N];
    void init(int n){
        for(int i = 1; i <= n; ++i){
            parent[i] = i;
            universal[i] = false;
            v[i].clear();
            umap[i].clear();
        }
    }
    int find(int x){
        return parent[x] == x ? x : parent[x] = find(parent[x]);
    }
    int unite(int x, int y){
        x = find(x); y = find(y);
        if(x == y) return x;
        if(v[x].size() < v[y].size()) swap(x, y);
        parent[y] = x;
        if(--parties.cnt[party[x]] == 1) q.push(party[x]);
        for(int u : v[y]) v[x].insert(u);
        v[y].clear();
        return x;
    }
    int unite_universal(int x, int y){
        x = find(x); y = find(y);
        if(x == y) return x;
        if(umap[x].size() < umap[y].size()) swap(x, y);        
        parent[y] = x;
        for(auto [c,v] : umap[y]){
            v = find(v);
            if(universal[v]) continue;
            auto& e = umap[x][c];
            if(e){
                int u = find(e);
                e = universal[u] ? v : unite(u,v);
            }
            else e = v;
        }
        umap[y].clear();
        return x;
    }
} dsu2;

bool solve(){
    int distinct = 0, visited = 0;
    int n, m, k; cin >> n >> m >> k;
    dsu1.init(n);
    dsu2.init(n);
    parties.init(k);
    while(q.size()) q.pop();
    vector <int> a(n+1);
    for(int i = 1; i <= n; ++i) cin >> a[i];
    vector <pair<int,int>> edges(m);
    for(auto &[u,v] : edges) cin >> u >> v;
    for(auto &[u,v] : edges) if(a[u] == a[v]) dsu1.unite(u, v);
    vector <int> id(n+1);
    for(int i = 1; i <= n; ++i){
        id[i] = dsu1.find(i);
        if(id[i] != i) continue;
        dsu2.party[i] = a[i];
        parties.add(a[i], i);
    }
    for(auto &[u,v] : edges){
        int _u = id[u], _v = id[v];
        if(_u == _v) continue;
        dsu2.v[_u].insert(_v);
        dsu2.v[_v].insert(_u);
    }
    for(int i = 1; i <= k; ++i){
        distinct += (parties.cnt[i] != 0);
        if(parties.cnt[i] == 1) q.push(i);
    }
    while(q.size()){
        int p = dsu2.find(parties.rep[q.front()]);
        q.pop();
        visited++;
        dsu2.universal[p] = true;
        vector <int> uni_sas;
        for(int _x : dsu2.v[p]){
            int x = dsu2.find(_x);
            if(x == p) continue;
            if(dsu2.universal[x]){
                uni_sas.push_back(x);
                continue;
            }
            auto& e = dsu2.umap[p][dsu2.party[x]];
            if(e){
                int u = dsu2.find(e);
                e = dsu2.universal[u] ? x : dsu2.unite(u, x);
            }
            else e = x;
        }
        dsu2.v[p].clear();
        for(int u : uni_sas) p = dsu2.unite_universal(p, u);
    }
    return distinct == visited;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t = 1; cin >> t;
    for(;t--;) cout << (solve() ? "TAK\n" : "NIE\n");
}