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

using namespace std;

typedef long long ll;
#define st first
#define nd second
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>

const int maxn = 1e5+7;

int kolor[maxn];
int rep[maxn];
int rozmiar[maxn];
int ilekoloru[maxn];
bool czyusuniety[maxn];
set<pii> graf[maxn];  //(kolor,v)
queue<int> Q;

int Find(int a){
    if(a == rep[a])
        return a;
    rep[a] = Find(rep[a]);
    return rep[a];
}

void Union(int a,int b){
    int rep_a = Find(a);
    int rep_b = Find(b);

    if(rep_a == rep_b)
        return; 

    if(rozmiar[rep_a] > rozmiar[rep_b])
        swap(rep_a,rep_b);

    rozmiar[rep_b] += rozmiar[rep_a];
    for(auto it : graf[rep_a]){
        graf[rep_b].insert(it);
    }
    rep[rep_a] = rep_b;

    if(rozmiar[rep_b] == ilekoloru[kolor[b]])
        Q.push(rep_b);
}

void Union2(int a,int b){
    int rep_a = Find(a);
    int rep_b = Find(b);

    if(rep_a == rep_b)
        return; 

    if(rozmiar[rep_a] > rozmiar[rep_b])
        swap(rep_a,rep_b);

    rozmiar[rep_b] += rozmiar[rep_a];
    for(auto it : graf[rep_a]){
        auto it2 = graf[rep_b].lower_bound({it.st,-1});
        if((it2 != graf[rep_b].end()) && (*it2).st == it.st)
            Union(it.nd,(*it2).nd);
        else
            graf[rep_b].insert(it);
    }
    rep[rep_a] = rep_b;
}

void czysc(int n,int k){
    for(int i=1;i<=n;i++){
        kolor[i] = 0;
        rep[i] = 0;
        rozmiar[i] = 0;
        graf[i].clear();
    }
    for(int i=1;i<=k;i++){
        ilekoloru[i] = 0;
        czyusuniety[i] = 0;
    }
}

void solve(){
    int n,m,k;
    cin>>n>>m>>k;

    int ileusunietych = 0;

    for(int i=1;i<=n;i++){
        cin>>kolor[i];
        rep[i] = i;
        rozmiar[i] = 1;
        ilekoloru[kolor[i]]++;
    }

    for(int i=1;i<=k;i++){
        if(ilekoloru[i] == 0)
            ileusunietych++;
    }

    vector<pii> kraw;
    int a,b;
    for(int i=1;i<=m;i++){
        cin>>a>>b;
        graf[a].insert({kolor[b],b});
        graf[b].insert({kolor[a],a});
        kraw.pb({a,b});
    }

    for(int i=1;i<=n;i++){
        if(ilekoloru[kolor[i]] == 1)
            Q.push(i);
    }

    for(auto [x,y] : kraw){
        if(kolor[x] == kolor[y])
            Union(x,y);
    }
    //cout<<Q.size()<<"\n";
    while(Q.size() != 0){
        a = Q.front();
        a = Find(a);
        Q.pop();
        ileusunietych++;
        czyusuniety[kolor[a]] = 1;
        
        pii ost = {-1,-1};
        for(auto it : graf[a]){
            if(czyusuniety[it.st])
                continue;
            if(it.st == ost.st){
                Union(it.nd,ost.nd);
                graf[a].erase(ost);
            }
            ost = it;
        }
        set<pii> akt = graf[a];
        for(auto it : akt){
            if(czyusuniety[it.st]){
                Union2(a,it.nd);
            }
        }        
    }

    if(ileusunietych == k)
        cout<<"TAK\n";
    else
        cout<<"NIE\n";

    czysc(n,k);
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin>>t;
    while(t--){
        solve();
    }

    return 0;
}