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

vector<vector<int>> arr;
vector<bool> vis;
vector<bool> cmp;
vector<int> owns;
int nsp;

void dfs(int v){
    vis[v] = 1; 
    for (auto& i : arr[v]){
        if (!vis[i]){
            if (owns[i] == owns[v]){
                dfs(i);
            }
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin >> t; 
    while (t--){
        int n, m, k; cin >> n >> m >> k;
        nsp = 0;
        arr.resize(n);
        vis.assign(n, 0);
        cmp.assign(n, 0);
        owns.assign(n, 0);
        for (int i = 0; i < n; i++){
            cin >> owns[i];
            owns[i]--;
        }

        for (int i = 0; i < m; i++){
            int a, b; cin >> a >> b;
            arr[a-1].push_back(b-1);
            arr[b-1].push_back(a-1);
        }
        for (int i = 0; i < n; i++){
            if (!vis[i]){
                if (cmp[owns[i]])
                    nsp++;
                dfs(i);
                cmp[owns[i]] = 1;
            }
        }
        if (nsp >= 2)
            cout << "NIE\n";
        else
            cout << "TAK\n";
        arr.clear();
    }
    return 0;
}