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
#include <bits/stdc++.h>
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
const ll mod=1000000007;

#ifdef LOCAL
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

const int N=100007;

vector<int>G[N],V[N];
int x[N],ile[N],r[N],r1[N];
bool odw[N];
deque<int>Q;

map<int,int>M[N];

int Find(int v)
{
	if(r[v]==v) return v;
	return r[v]=Find(r[v]);
}
void Union(int u,int v)
{
	u=Find(u),v=Find(v);
	if(u==v) return ;
	r[u]=v;
	ile[x[u]]--;
	if(!odw[x[u]]&&ile[x[u]]==0) 
	{
		odw[x[u]]=1;
		Q.pb(x[u]);
	}
}

int Find1(int v)
{
	if(r1[v]==v) return v;
	return r1[v]=Find1(r1[v]);
}
void Merge(int u,int v)
{
	u=Find1(u),v=Find1(v);
	if(u==v) return ;
	if(sz(M[u])>sz(M[v])) swap(u,v);
	r1[u]=v;
	for(auto [i,y]:M[u])
	{
		if(odw[i]) continue;
		int t=M[v][i];
		if(t>0) Union(t,y);
		else M[v][i]=y;
	}
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int tt;
    cin>>tt;
    while(tt--)
    {
		int n,m,k;
		cin>>n>>m>>k;
		FOR(i,1,n)
		{
			cin>>x[i];
			V[x[i]].pb(i);
		}
		Q.clear();
		FOR(i,1,k)
		{
			ile[i]=sz(V[i])-1;
			if(ile[i]<=0)
			{
				odw[i]=1;
				Q.pb(i);
			}
		}
		FOR(i,1,n) r[i]=i,r1[i]=0;
		FOR(i,1,m)
		{
			int a,b;
			cin>>a>>b;
			G[a].pb(b);
			G[b].pb(a);
			if(x[a]==x[b]) Union(a,b);
		}
		while(sz(Q)>0)
		{
			int i=Q[0];
			Q.pop_front();
			debug(i);
			for(auto v:V[i])
			{
				r1[v]=v;
				for(auto u:G[v])
				{
					if(odw[x[u]]) continue;
					int t=M[v][x[u]];
					if(t>0) Union(t,u);
					else M[v][x[u]]=u;
				}
			}
			for(auto v:V[i])
			{
				for(auto u:G[v]) if(r1[u]) Merge(u,v);
			}
		}
		bool ok=1;
		FOR(i,1,k) ok&=odw[i];
		if(ok) cout<<"TAK"<<endl;
		else cout<<"NIE"<<endl;
		FOR(i,0,max({n,m,k}))
		{
			G[i].clear();
			V[i].clear();
			M[i].clear();
			ile[i]=0;
			odw[i]=0;
		}
	}
    
    
    
    return 0;
}