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
#pragma GCC optimize("O3")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
//using namespace __gnu_pbds;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
 
//typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> oset;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }

template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }

#ifdef LOCAL
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif

const ll mod = 1e9+7;
const ll infi  = 1e18+1;
const ld eps = 1e-14L;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int tt; cin >> tt;
    while(tt--){
        int n, m, k; cin >> n >> m >> k;
        vector<int> col(n+1);
        for(int i=1;i<=n;i++) cin >> col[i];
        vector<vector<int>> adj(n+1);
        for(int i=0;i<m;i++){
            int a, b; cin >> a >> b;
            adj[a].push_back(b);
            adj[b].push_back(a);
        }
        vector<int> used(n+1), rep(n+1), repcol(1), repcnt(k+1);
        vector<vector<int>> colverts(k+1);
        int cnt = 0;

        auto dfs = [&](auto &&self, int v) -> void {
            rep[v] = cnt;
            colverts[col[v]].push_back(v);
            for(auto u : adj[v]){
                if(!used[u] && col[v] == col[u]){
                    used[u] = 1;
                    self(self, u);
                }
            }
        };

        for(int i=1;i<=n;i++){
            if(used[i]) continue;
            used[i] = 1; cnt++;
            repcnt[col[i]]++;
            repcol.push_back(col[i]);
            dfs(dfs, i);
        }
        vector<int> parent(cnt+1), sajz(cnt+1, 1), rem(k+1);
        queue<int> q;
        iota(parent.begin(), parent.end(), 0);

        auto find = [&](auto &&self, int v) -> int {
            return parent[v] == v ? v : parent[v] = self(self, parent[v]);
        };

        auto uni = [&](int a, int b) -> void {
            a = find(find, a); b = find(find, b);
            if(a == b) return;
            if(sajz[a] < sajz[b]) swap(a, b);
            parent[b] = a;
            sajz[a] += sajz[b];
            int c = repcol[a];
            if(--repcnt[c] == 1 && !rem[c]) q.push(c);
        };

        for(int i=1;i<=k;i++){
            if(repcnt[i] <= 1) q.push(i);
        }

        vector<int> dparent(n+1), dsajz(n+1, 1), alive(n+1, 1);
        iota(dparent.begin(), dparent.end(), 0);
        vector<map<int,int>> cross(n+1);

        auto dfind = [&](auto &&self, int v) -> int {
            return dparent[v] == v ? v : dparent[v] = self(self, dparent[v]);
        };

        auto add = [&](int a, int b, int c) -> void {
            b = find(find, b);
            auto &mp = cross[a];
            auto it = mp.find(c);
            if(it == mp.end()){
                mp[c] = b;
                return;
            }
            int pot = find(find, it->second);
            if(pot == b){
                mp[c] = b;
            } else {
                uni(b, pot);
                mp[c] = find(find, pot);
            }
        };

        auto duni = [&](int a, int b) -> void {
            a = dfind(dfind, a); b = dfind(dfind, b);
            if(a == b) return;
            if(dsajz[a] < dsajz[b]) swap(a, b);
            dparent[b] = a;
            dsajz[a] += dsajz[b];
            if(cross[a].size() < cross[b].size()) swap(cross[a], cross[b]);
            for(auto [c, v] : cross[b]) add(a, v, c);
        };

        int ans = 0;
        while(!q.empty()){
            int c = q.front(); q.pop();
            if(rem[c]) continue;
            rem[c] = 1;
            ans++;
            for(auto v : colverts[c]){
                alive[v] = 0;
            }

            for(auto v : colverts[c]){
                for(auto u : adj[v]){
                    if(!alive[u]) duni(v, u);
                }
            }

            for(auto v : colverts[c]){
                auto vrep = dfind(dfind, v);
                for(auto u : adj[v]){
                    if(alive[u]) add(vrep, rep[u], col[u]);
                }
            }
        }
        cout << (ans == k ? "TAK" : "NIE") << '\n';
    }
    return 0;
}