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

typedef long long ll;

using namespace std;

void solve(){
    int n, m, k;
    cin >> n >> m >> k;

    vector<int> color(n);
    vector<vector<int>> g(n);

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

    for(int i = 0; i < m; i++){
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    vector<int> blob(n, -1);

    function<void(int, int)> dfsBlob = [&](int w, int b){
        blob[w] = b;
        for(int v : g[w]){
            if(blob[v] == -1 and color[v] == color[b])
                dfsBlob(v, b);
        }
    };

    vector<vector<int>> colorBlobs(k+1);
    int cnt = 0;
    for(int w = 0; w < n; w++){
        if(blob[w] == -1){
            dfsBlob(w, w);
            colorBlobs[color[w]].push_back(w);
            cnt++;
        }
    }
    vector<int> colorVis(k+1);
    queue<int> q;
    for(int i = 1; i <= k; i++){
        if(colorBlobs[i].size() == 1) {
            q.push(colorBlobs[i][0]);
            colorVis[i] = true;
        }
    }

    vector<bool> vis(n);
    vector<int> parent(n);
    for(int i = 0; i < n; i++) parent[i] = i;
    vector<int> size(n, 1);

    function<int(int)> fund = [&](int a){
        if(parent[a] != a) parent[a] = fund(parent[a]);
        return parent[a]; 
    };

    vector<map<int, int>> blobMap(n);

    function<int(int,int)> onion = [&](int a, int b){
        a = fund(a);
        b = fund(b);
        if(a == b) return size[a];
        if(size[a] < size[b]) swap(a, b);
        size[a] += size[b];
        parent[b] = a;
        if(blobMap[a].size() < blobMap[b].size()) swap(blobMap[a], blobMap[b]);
        for(auto [key, val] : blobMap[b]){
            if(blobMap[a].count(key) != 0){
                if(!colorVis[key] && onion(blobMap[a][key], val) == colorBlobs[key].size()){
                    for(int x : colorBlobs[key]){
                        q.push(x);
                    }
                    colorVis[key] = true;
                }
            }else{
                blobMap[a][key] = val;
            }
        }
        return size[a];
    };


    function<void(int, int)> dfs = [&](int w, int b){
        vis[w] = true;
        for(int v : g[w]){
            if(vis[v]){
                onion(b, blob[v]);
                continue;
            }
            if(color[v] == color[b]){
                dfs(v, b);
            }else{
                auto & mapka = blobMap[fund(b)];
                if(mapka.count(color[v]) == 0){
                    mapka[color[v]] = blob[v];
                }
                if(!colorVis[color[v]] && onion(blob[v], mapka[color[v]]) == colorBlobs[color[v]].size()){
                    for(int x : colorBlobs[color[v]]){
                        q.push(x);
                    }
                    colorVis[color[v]] = true;
                }
            }
        }
    };
    while(!q.empty()){
        int b = q.front();
        q.pop();
        dfs(b, b);
        // cout << b+1<<endl;
        cnt--;
    }
    cout << (cnt == 0 ? "TAK\n" : "NIE\n");
}

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

    int t;
    cin >> t;
    while(t--){
        solve();
    }
    
    return 0;
}