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
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define pii pair<int,int>
using namespace std;
const int N = 1e5+1;

int rep[N],rep2[N],skladowe[N],col[N];
vector<int>G[N],lista[N],found[N];
bitset<N>odw;
queue<int>q;
unordered_map<int,int>reps[N];

void wyczysc(int n,int k){
     while(!q.empty())q.pop();
    for(int i = 1;i <= n;i++){
        G[i].clear();
        rep[i] = i;
        col[i] = 0;
    }
    for(int i = 1;i <= k;i++){
        odw[i] = 0;
        rep2[i] = i;
        reps[i].clear();
        lista[i].clear();
        skladowe[i] = 0;
        found[i].clear();
    }
}

void Find(int x){
    if(rep[x] != x)
        Find(rep[x]);
    rep[x] = rep[rep[x]];
}

void Union(int x,int y,int k){
    Find(x);
    Find(y);
    if(rep[x] != rep[y]){
        rep[rep[y]] = rep[rep[x]];
        skladowe[k]--;
        if(skladowe[k] == 1){
            odw[k] = 1;
            q.push(k);
        }
    }
}

void join(int u,int v){
    for(auto [c,r]: reps[v]){
        if(reps[u].count(c))Union(r,reps[u][c],c);
        reps[u][c] = r;
    }
    rep2[rep2[v]] = rep2[rep2[u]];
}

void Find2(int x){
    if(rep2[x] != x)
        Find2(rep2[x]);
    rep2[x] = rep2[rep2[x]];
}

void Union2(int x,int y){
    Find2(x);
    Find2(y);
    if(rep2[x] != rep2[y]){
        int u = rep2[x],v = rep2[y];
        if(reps[u].size() < reps[v].size())join(v,u);
        else join(u,v);
    }
}

void solve(){
    int n,m,k;
    cin >> n >> m >> k;
    wyczysc(n,k);
    for(int i = 1;i <= n;i++){
        cin >> col[i];
        lista[col[i]].pb(i);
        skladowe[col[i]]++;
    }

    for(int i = 0;i < m;i++){
        int a,b;
        cin >> a >> b;
        G[a].pb(b);
        G[b].pb(a);
        if(col[a] == col[b])Union(a,b,col[a]);
    }

    for(int i = 1;i <= k;i++)
        if(skladowe[i] == 1 && !odw[i])
            q.push(i);

    while(!q.empty()){
        int c = q.front();
        odw[c] = 1;
        q.pop();
        //cout << c << "\n";
        for(auto v: lista[c]){
            for(auto u: G[v]){
                int c2 = col[u];
                if(odw[c2])Union2(c,c2);
                if(c2 == c)continue;
                Find2(c);
                int c_rep = rep2[c];
                if(reps[c_rep].count(c2))Union(u,reps[c_rep][c2],c2);
                reps[c_rep][c2] = u;
            }
        }

    }
    for(int i = 1;i <= k;i++){
        if(skladowe[i] > 1){
            cout << "NIE\n";
            return;
        }
    }
    //cout << rep2[1] << " " << rep2[2];
    cout << "TAK\n";
}

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