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

#define ll long long
#define st first
#define nd second
#define ld long double

void pchnij(int v, vector<int> &o) {
    if (o[v] != o[o[v]]) {
        pchnij(o[v], o);
        o[v] = o[o[v]];
    }
}

bool razem(int v, int u, vector<int> &o) {
    pchnij(v, o), pchnij(u, o);
    return o[v]==o[u];
}

void lacz(int v, int u, vector<int> &o, vector<int> &r) {
    if (razem(v, u, o)) return;
    v = o[v], u = o[u];
    if (r[v] < r[u]) {
        swap(v, u);
    }
    o[u] = v;
    r[v] += r[u];
}

void lacz2(int v, int u, vector<int> &o, vector<int> &r, vector<int> &wi, vector<int> &a) {
    if (razem(v, u, o)) return;
    wi[a[v]]--;
    v = o[v], u = o[u];
    if (r[v] < r[u]) {
        swap(v, u);
    }
    o[u] = v;
    r[v] += r[u];
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    vector<int> a (n+1, 0);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    vector<vector<int>> w (k+1);
    vector<int> wi (k+1);
    for (int i = 1; i <= n; i++) {
        w[a[i]].push_back(i);
        wi[a[i]]++;
    }
    vector<int> o (n+1), r (n+1, 1);
    for (int i = 1; i <= n; i++) {
        o[i] = i;
    }
    vector<vector<int>> g (n+1);
    for (int i = 0; i < m; i++) {
        int v, u;
        cin >> v >> u;
        if (a[u] == a[v]) {
            lacz2(v, u, o, r, wi, a);
        }
        else {
            g[v].push_back(u);
            g[u].push_back(v);
        }
    }
    queue<int> q;
    int il = 0;
    vector<bool> odwk (k+1, 0), odw2(k+1);
    for (int i = 1; i <= k; i++) {
        if (wi[i]==0) {
            il++;
        }
        if (wi[i]==1) {
            q.push(i);
            odw2[i]=1;
        }
    }
    vector<map<int, int>> mp (n+1);
    while (!q.empty()) {
        il++;
        int c = q.front();
        //cout << c << '\n';
        q.pop();
        int p = w[c][0];
        odwk[c] = 1;
        pchnij(p, o);
        p = o[p];
        set<pair<int, int>, greater<pair<int, int>>> gr1;
        gr1.insert({mp[p].size(), p});
        set<int> gr2;
        for (int i : w[c]) {
            for (int j : g[i]) {
                pchnij(j, o);
                int x = o[j];
                if (odwk[a[x]]) {
                    gr1.insert({mp[x].size(), x});
                }
                else {
                    gr2.insert(x);
                }
            }
        }
        p = (*gr1.begin()).nd;
        gr1.erase(gr1.begin());
        for (auto i : gr1) {
            pchnij(i.nd, o);
            o[o[i.nd]] = p;
            for (auto j : mp[i.nd]) {
                if (odwk[a[j.nd]]) continue;
                pchnij(j.nd, o);
                int x = o[j.nd];
                if (mp[p][a[x]] == 0) {
                    mp[p][a[x]] = x;
                }
                else {
                    int y = mp[p][a[x]];
                    lacz2(y, x, o, r, wi, a);
                    if (wi[a[x]]==1) {
                        if (!odw2[a[x]]) {
                            q.push(a[x]);
                            odw2[a[x]]=1;
                        }
                    }
                }
            }
        }
        for (int i : gr2) {
            pchnij(i, o);
            int x = o[i];
            if (mp[p][a[x]]==0) {
                mp[p][a[x]] = x;
            }
            else {
                int y = mp[p][a[x]];
                lacz2(y, x, o, r, wi, a);
                if (wi[a[x]]==1) {
                    if (!odw2[a[x]]) {
                        q.push(a[x]);
                        odw2[a[x]]=1;
                    }
                }
            }
        }
    }
    if (il==k) {
        cout << "TAK\n";
    }
    else {
        cout << "NIE\n";
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
}