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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
//Solution by Mikołaj Kołek

#include "bits/stdc++.h"
#define intin *istream_iterator<int>(cin)

using namespace std;

struct FindUnion {
	vector<int> P, R, sizes, winners, partySizes;
	queue<int> merged;
	
	FindUnion(size_t size, int partyCount, vector<int> _winners) 
		: P(size), R(size), sizes(size, 1), winners(_winners), partySizes(partyCount) {
		iota(P.begin(), P.end(), 0);
		
		for(auto &el : winners)
			partySizes[el]++;
		
		for(int i = 0; i < partyCount; i++)
			if(partySizes[i] == 0 or partySizes[i] == 1)
				merged.push(i);
	}
	
	int find(int v) {
		if(P[v] == v)
			return v;
		
		return P[v] = find(P[v]);
	}
	
	void unify(int a, int b) {
		a = find(a), b = find(b);
		if(a == b)
			return;
		
		if(R[a] > R[b]) {
			sizes[a] += sizes[b];
			if(sizes[a] == partySizes[winners[a]])
				merged.push(winners[a]);
			
			P[b] = a;
		}
		else {
			sizes[b] += sizes[a];
			if(sizes[b] == partySizes[winners[b]])
				merged.push(winners[b]);
			
			P[a] = b;
			R[a] += (R[a] == R[b]);
		}
	}
	
	bool hasMerged() {
		return !merged.empty();
	}
	
	int getMerged() {
		int res = merged.front();
		merged.pop();
		return res;
	}
};

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t = intin;
	while(t--) {
		int n = intin, m = intin, k = intin;
		vector<int> winners(n);
		vector<vector<int>> forWinner(k);
		for(int i = 0; i < n; i++) {
			winners[i] = intin - 1;
			forWinner[winners[i]].push_back(i);
		}
		
		FindUnion F(n, k, winners);
		vector<vector<int>> G(n);
		for(int i = 0; i < m; i++) {
			int u = intin - 1, v = intin - 1;
			G[u].push_back(v);
			G[v].push_back(u);
			
			if(winners[u] == winners[v])
				F.unify(u, v);
		}
		
		int done = 0;
		vector<bool> partyIsDone(k);
		vector<unordered_map<int, int>> doneNeighbors(k);
		while(F.hasMerged()) {
			int current = F.getMerged();
			partyIsDone[current] = true;
			done++;
			
			unordered_set<int> toMerge;
			toMerge.insert(current);
			for(auto &v : forWinner[current]) {
				for(auto &u : G[v]) {
					int uWinner = winners[u];
					if(uWinner == current)
						continue;
					if(partyIsDone[uWinner]) {
						toMerge.insert(winners[F.find(u)]);
						F.unify(u, forWinner[current][0]);
						continue;
					}
					
					if(doneNeighbors[current].count(uWinner))
						F.unify(u, doneNeighbors[current][uWinner]);
					else
						doneNeighbors[current][uWinner] = u;
				}
			}
			
			int mx = current, mxSize = doneNeighbors[current].size();
			for(auto &party : toMerge) {
				if(doneNeighbors[party].size() > mxSize) {
					mx = party;
					mxSize = doneNeighbors[party].size();
				}
			}
			
			for(auto &party : toMerge) {
				if(party == mx)
					continue;
				
				for(auto &[key, val] : doneNeighbors[party]) {
					if(doneNeighbors[mx].contains(key))
						F.unify(doneNeighbors[mx][key], val);
					else
						doneNeighbors[mx][key] = val;
				}
			}
			if(!forWinner[current].empty() and winners[F.find(forWinner[current][0])] != mx)
				doneNeighbors[winners[F.find(forWinner[current][0])]] = move(doneNeighbors[mx]);
		}
		
		cout << ((done == k) ? "TAK\n" : "NIE\n");
	}
	
	return 0;
}

/*
Tests:
3
5 5 3
1 2 1 1 3
1 2
2 3
3 4
4 5
5 1
4 3 3
2 2 2 2
1 2
1 3
1 4
4 3 2
1 2 1 2
1 2
2 3
3 4
TAK TAK NIE

1
7 6 3
1 1 3 3 2 2 1
1 3
2 3
4 3
5 4
6 4
6 7
TAK


*/