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

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)


#define VI vector<int>
#define PII pair<int,int>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define lint long long int


#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; }
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; }
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}


#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue


#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));


using namespace std;

int n, m, k;

unordered_set<int> g[100005];
int col[100005];
int ile[100005];
int fup[100005];
VI que;
int pos;

void clean() {
	FOR(i,0,k+1) ile[i] = 0;
	FOR(i,0,n) g[i].clear();
	FOR(i,0,n) fup[i] = 0;
	FOR(i,0,n) col[i] = 0;
	que.clear();
	pos = 0;
}

int par(int u) {
	return (u == fup[u]) ? u : (fup[u] = par(fup[u]));
}

void merge(int u, int v) {
	u = par(u);
	v = par(v);
	if (u == v) return;
	if (g[u].size() > g[v].size()) swap(u,v);
	for (int x : g[u]) {
		if (x == v || x == u) continue;
		g[v].insert(par(x));
		g[x].erase(u);
		g[x].insert(v);
	}
	fup[u] = v;
	ile[col[v]]--;
	if (col[v] != 0 && ile[col[v]] == 1) {
		que.pb(v);
	}
}

void solve() {
	read3(n,m,k);
	clean();
	FOR(i,0,n) {
		make(a); col[i] = a;
		ile[a]++;
	}
	pos = 0;
	vector<PII> e;
	FOR(i,0,m) {
		make2(a, b);
		a--; b--;
		g[a].insert(b); g[b].insert(a);
		e.pb({a,b});
	}
	FOR(i,0,n) fup[i] = i;
	FOR(i,0,n) if(ile[col[i]] == 1) que.pb(i);
	FOR(i,0,e.size()) {
		int a = e[i].st;
		int b = e[i].nd;

		if (col[a] == col[b]) merge(a,b);	
	}
	while (pos < que.size()) {
		int x = que[pos]; pos++;
		VI szare;
		x = par(x);
		col[x] = 0;
		for (int y : g[x]) {
			int u = par(y);
			if (u == x) continue; 
			if (col[u] == 0) {
				szare.pb(u);
			}
		}
		for (int i = 0; i < szare.size(); i++) {
			int w = szare[i];
			merge(par(w), x);
			x = par(x);
		}
		vector<PII> by_color;
		for (int y : g[x]) {
			int u = par(y);
			if (u == x) continue;
			by_color.pb({col[u], u});	
		}
		sort(by_color.begin(), by_color.end());
		int cur = -1;
		int kto = -1;
		for (int i = 0; i < by_color.size(); i++) {
			int c = by_color[i].st;
			int u = by_color[i].nd;
			if (c == cur) {
				merge(kto, u);
				kto = par(kto);
			} else {
				cur = c;
				kto = u;
			}
		}
	}
	int ok = true;
	FOR(i,1,k+1) if (ile[i] > 1) ok = false;

	if (ok) printf("TAK\n");
	else printf("NIE\n");
		
	
	clean();
}


int main() {
	make(z);
	while (z--) {
		solve();
	}
}