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
#include <algorithm>
#include <bits/stdc++.h>
#define nl '\n'

using namespace std;

int find(int v, vector<int>& repr){
    return repr[v] == v ? v : repr[v] = find(repr[v], repr);
}

int Union(int a, int b, vector<int>& repr){
    a = find(a, repr);
    b = find(b, repr);
    if(a != b){
        repr[b] = a;
        return 1;
    }
    return 0;
}

void solve(){
    int n, m, k;
    cin>>n>>m>>k;
    vector<int> components(k+1, 0);
    vector<int> color(n+1, 0);
    vector<int> repr(n+1, 0);
	vector<unordered_map<int, int>> color_repr(n+1);
    for(int i=1; i<=n; i++){ repr[i] = i; }
    vector<vector<int>> G(n+1);
	vector<vector<int>> nodes(k+1);
	vector<int> wrzuconed(k+1, 0);
    for(int i=1; i<=n; i++){
        cin>>color[i];
        components[color[i]]++;
		nodes[color[i]].push_back(i);
    }
    queue<int> q;
    while(m--){
        int a, b;
        cin>>a>>b;
        G[a].push_back(b);
        G[b].push_back(a);
        if(color[a] == color[b]){
            components[color[a]] -= Union(a, b, repr);
        }
    }
	for(int i=1; i<=k; i++){
		if(components[i] == 1){
			q.push(i);
			wrzuconed[i] = 1;
		}
	}
	vector<int> seen(k+1, 0);
	int map_access_count = 0;
	int phase1_repr_generated = 0;
    while(q.size()){
		int C = q.front();
		//cerr<<C<<nl;
		assert(!seen[C]);
		seen[C] = 1;
        q.pop();
		if(nodes[C].empty()) continue;
		int leader = find(nodes[C][0], repr);
		color[leader] = 0;
		set<int> zeros;
		for(auto v: nodes[C]){
			for(auto i: G[v]){
				i = find(i, repr);
				int c = color[i];
				if(!c){
					zeros.insert(i);
				}else if(color_repr[leader].count(c)){
					components[c] -= Union(color_repr[leader][c], i, repr);
					if(components[c] == 1 && !wrzuconed[c]){ q.push(c); wrzuconed[c] = 1;}
				}else{
					color_repr[leader][c] = i;
					phase1_repr_generated++;
				}
			}
		}
		for(auto v: zeros){
			leader = find(leader, repr);
			v = find(v, repr);
			if(color_repr[v].size() > color_repr[leader].size()){
				swap(v, leader);
			}
			for(auto [c, r]: color_repr[v]){
				map_access_count++;
				//cerr<<c<<' '<<find(r, repr)<<nl;
				if(color_repr[leader].count(c)){
					components[c] -= Union(r, color_repr[leader][c], repr);
					if(components[c] == 1 && !wrzuconed[c]){ q.push(c); wrzuconed[c] = 1;}
				}else{
					color_repr[leader][c] = r;
				}
			}
			repr[v] = leader;
		}
    }
	//cerr<<phase1_repr_generated<<' '<<map_access_count<<nl;
	for(int i=1; i<=n; i++){
		if(color[find(i, repr)]){
			cout<<"NIE"<<nl;
			return;
		}
	}
	cout<<"TAK"<<nl;
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}