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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <stack>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int MAXN=100000+11;
int n, m, k, t;
int city_party[MAXN];
map<int, list<int>> city_party_edges[MAXN];
set<int> party_sets[MAXN];
queue<int> one_set_party_v;
bool blackhole[MAXN];

int parent[MAXN];
// int set_size[MAXN];

int find_set(int v) {
    if (v == parent[v])
        return v;
    return parent[v] = find_set(parent[v]);
}
void make_set(int v) {
    parent[v] = v;
    // set_size[v] = 1;
}
int union_sets(int a, int b) {
    a = find_set(a);
    b = find_set(b);
    if (a != b) {
        // assert(blackhole[a] == blackhole[b]);
        if (!blackhole[a]) {
            // if (set_size[a] < set_size[b])
            //     swap(a, b);
            if (city_party_edges[a].size() < city_party_edges[b].size())
                swap(a, b);
            parent[b] = a;
            // set_size[a] += set_size[b];

            int party = city_party[a];
            party_sets[party].erase(b);
            if (party_sets[party].size() == 1) {
                one_set_party_v.push(a);
            }

            FORE(ei, city_party_edges[b]) {
                int party = ei->first;
                city_party_edges[a][party].splice(city_party_edges[a][party].begin(), ei->second);
            }
        } else {
            if (city_party_edges[a].size() < city_party_edges[b].size())
                swap(a, b);
            parent[b] = a;
            // set_size[a] += set_size[b];

            FORE(pi, city_party_edges[b]) {
                int party = pi->first;
                auto party_edges = pi->second;
                auto bi = party_edges.begin();
                int b_v = *bi;
                auto ai = city_party_edges[a].find(party);
                if (ai != city_party_edges[a].end()) {
                    int a_v = *ai->second.begin();
                    union_sets(b_v, a_v);
                } else {
                    city_party_edges[a][party].push_back(b_v);
                }
            }
        }
    }
    return a;
}

bool solve() {
    cin>>n>>m>>k;
    FOR(ki, 1, k) {
        party_sets[ki].clear();
    }
    FOR(ni, 1, n) {
        cin>>city_party[ni];
        blackhole[ni] = false;
        make_set(ni);
        party_sets[city_party[ni]].insert(ni);
        city_party_edges[ni].clear();
    }
    FOR(ki, 1, k) {
        if (party_sets[ki].size()==1) {
            one_set_party_v.push(*party_sets[ki].begin());
        }
    }
    REP(mi, m) {
        int u, v;
        cin >> u >> v;
        u = find_set(u);
        v = find_set(v);
        if (city_party[u] == city_party[v]) {
            if (u==v) continue;
            union_sets(u, v);
        } else {
            city_party_edges[u][city_party[v]].push_back(v);
            city_party_edges[v][city_party[u]].push_back(u);
        }
    }
    // cout<<"\n";
    while (!one_set_party_v.empty()) {
        int party_v = one_set_party_v.front();
        one_set_party_v.pop();
       // cout << party_v << " " << city_party[party_v] << "\n";

        //assert(blackhole[party_v]==false);
        blackhole[party_v]=true;

        list<int> blackholes_to_merge;

        FORE(pi, city_party_edges[party_v]) {
            auto party_edges = pi->second;
            auto ei = party_edges.begin();
            int first_v = find_set(*ei);
            if (blackhole[first_v]) {
                blackholes_to_merge.push_back(first_v);
            } else {
                ++ei;
                while (ei!=party_edges.end()) {
                    union_sets(first_v, *ei);
                    ei = party_edges.erase(ei);
                }
            }
        }

        FORE(bi, blackholes_to_merge) {
            // cout << "merge blackholes " << party_v << " " << *bi << "\n";
            party_v = union_sets(party_v, *bi);
        }
    }
    FOR(ki, 1, k) {
        if (party_sets[ki].size() > 1) {
            return false;
        }
    }
    return true;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin >> t;
    REP(ti, t) {
        if (solve()) {
            cout<<"TAK\n";
        } else {
            cout<<"NIE\n";
        }
    }
    return 0;
}