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
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define all(x) (x).begin(), (x).end()

int id[100007];
int rep[100007];
int siz[100007];
int lspoj[100007];
vector<int> ktotu;
vector<int> edges[100007];
vector<int> tegokoloru[100007];
vector<int> kabum;
vector<int> moje[100007];
map<pii,char> has;
map<pii,int> mp;
int bumd[100007];

int fin(int v){
    if(rep[v]==v) return v;
    rep[v]=fin(rep[v]);
    return rep[v];
}

void uni(int a, int b){
    // cout << "uni " << a << ' ' << b << '|' << fin(a) << ' ' << fin(b) << '\n';
    a=fin(a);
    b=fin(b);
    if(a==b) return;
    // assert(id[a]==id[b]);
    if(siz[a]>siz[b]) swap(a,b);
    for(auto v:moje[a]){
        // cout << a << " posiada " << v << '\n';
        if(bumd[v]==1) continue;
        if(has[{b, v}]==0){
            // cout << "cos sie nie zgadza\n";
            has[{b, v}]=1;
            moje[b].push_back(v);
            mp[{b, v}]=mp[{a, v}];
        }
        else{
            uni(mp[{a,v}], mp[{b,v}]);
        }
    }
    rep[a]=b;
    siz[b]+=siz[a];
    lspoj[id[a]]--;
    if(lspoj[id[a]]==1){
        kabum.push_back(id[a]);
        bumd[id[a]]=1;
    }
}

void solve() {
    int n, m, k, i, j;
    cin >> n >> m >> k;
    for(i=0; i<=max(n,k); i++){
        lspoj[i]=0;
        edges[i].clear();
        tegokoloru[i].clear();
        moje[i].clear();
        bumd[i]=0;
    }
    ktotu.clear();
    kabum.clear();
    has.clear();
    mp.clear();
    for(i=1; i<=n; i++){
        cin >> id[i];
        lspoj[id[i]]++;
        tegokoloru[id[i]].push_back(i);
        rep[i]=i;
        siz[i]=1;
    }
    lspoj[0]=1000000000;
    for(i=0; i<m; i++){
        int u,v;
        cin >> u >> v;
        edges[u].push_back(v);
        edges[v].push_back(u);
        if(id[u]==id[v]) uni(u, v);
    }
    for(i=1; i<=k; i++){
        if(bumd[i]==0 && lspoj[i]<=1){
            kabum.push_back(i);
            bumd[i]=1;
        }
    }
    while(!kabum.empty()){
        int bu=kabum.back();
        kabum.pop_back();
        // cout << "BUM " << bu << '\n';
        for(auto v:tegokoloru[bu]){
            for(auto u:edges[v]){
                if(id[u]==0 || id[u]==id[v]) continue;
                if(has[{fin(v), id[u]}]==0){
                    // cout << fin(v) << " dopisuje " << id[u] << " za pomoca " << v << ' ' << u << '\n';
                    has[{fin(v), id[u]}]=1;
                    moje[fin(v)].push_back(id[u]);
                    mp[{fin(v), id[u]}]=fin(u);
                }
                else if(mp[{fin(v), id[u]}]!=fin(u)){
                    uni(fin(u), mp[{fin(v), id[u]}]);
                    mp[{fin(v), id[u]}]=fin(u);
                }
            }
        }
        for(auto v:tegokoloru[bu]){
            for(auto u:edges[v]){
                if(id[u]==0){
                    uni(v, u);
                }
            }
        }
        for(auto v:tegokoloru[bu]){
            id[v]=0;
        }
    }
    for(i=1; i<=k; i++){
        if(!bumd[i]){
            cout << "NIE\n";
            return;
        }
    }
    cout << "TAK\n";
    return;
}

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