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

int find_set(int v, vector<int>& parent) {
    int root = v;
    while (root != parent[root]) root = parent[root];
    while (v != root) {
        int next = parent[v];
        parent[v] = root;
        v = next;
    }
    return root;
}

void merge_party(int a, int b, vector<int>& parent, vector<set<int>>& adj, const vector<int>& col, vector<int>& cnt_comp, queue<int>& Q, const vector<bool>& rmvd, vector<map<int, int>>& tchs) {
    a = find_set(a, parent);
    b = find_set(b, parent);
    if (a == b) return;
    if (adj[a].size() < adj[b].size()) swap(a, b);
    parent[b] = a;
    int c = col[a];
    cnt_comp[c]--;

    if (cnt_comp[c] == 1) Q.push(c);
    for (int idx : adj[b]) {
        idx = find_set(idx, parent);
        if (idx == a) continue;
        if (rmvd[col[idx]]) tchs[idx][c] = a;
        adj[a].insert(idx);
    }
    adj[b].clear();
}

void merge_wild(int w1, int w2, vector<int>& parent, vector<set<int>>& adj, const vector<int>& col, vector<int>& cnt_comp, queue<int>& Q, const vector<bool>& rmvd, vector<map<int, int>>& tchs) {
    w1 = find_set(w1, parent);
    w2 = find_set(w2, parent);
    if (w1 == w2) return;
    if (tchs[w1].size() < tchs[w2].size()) swap(w1, w2);

    parent[w2] = w1;

    for (pair<const int, int>& kv : tchs[w2]) {
        int c = kv.first;
        int cmpB = find_set(kv.second, parent);

        if (tchs[w1].count(c)) {
            int cmpA = find_set(tchs[w1][c], parent);
            merge_party(cmpA, cmpB, parent, adj, col, cnt_comp, Q, rmvd, tchs);
            tchs[w1][c] = find_set(cmpA, parent);
        } else {
            tchs[w1][c] = cmpB;
            adj[cmpB].insert(w1);
        }
    }
    tchs[w2].clear();
}


void solution(int n, int m, int k, const vector<int>& col, const vector<pair<int, int>>& e) {
    vector<int> f_col(k + 1, -1);
    for (int i = 1; i <= n; ++i) f_col[col[i]] = i;

    vector<int> parent(n + 1);
    for (int i = 0; i <= n; ++i) parent[i] = i;

    vector<int> cnt_comp(k + 1, 0);
    vector<bool> rmvd(k + 1, false);
    for (int c = 1; c <= k; ++c) if (f_col[c] == -1) rmvd[c] = true;

    vector<set<int>> adj(n + 1);
    vector<map<int, int>> tchs(n + 1);
    for (int i = 1; i <= n; ++i) cnt_comp[col[i]]++;

    for (auto& edge : e) {
        int u = edge.first;
        int v = edge.second;
        if (col[u] == col[v]) {
            int root_u = find_set(u, parent);
            int root_v = find_set(v, parent);
            if (root_u != root_v) {
                parent[root_v] = root_u;
                cnt_comp[col[root_u]]--;
            }
        }
    }

    for (auto& edge : e) {
        int u = edge.first;
        int v = edge.second;
        if (col[u] != col[v]) {
            int root_u = find_set(u, parent);
            int root_v = find_set(v, parent);
            adj[root_u].insert(root_v);
            adj[root_v].insert(root_u);
        }
    }

    queue<int> Q;
    for (int c = 1; c <= k; ++c) if (cnt_comp[c] == 1 && !rmvd[c]) Q.push(c);

    while (!Q.empty()) {
        int c = Q.front();
        Q.pop();
        if (rmvd[c]) continue;
        rmvd[c] = true;
        int jock = find_set(f_col[c], parent);
        vector<int> curr_adj(adj[jock].begin(), adj[jock].end());

        for (int idx : curr_adj) {
            idx= find_set(idx, parent);
            if (idx == jock) continue;

            if (rmvd[col[idx]]) {
                merge_wild(jock, idx, parent, adj, col, cnt_comp, Q, rmvd, tchs);
                jock = find_set(jock, parent);
            } else {
                int cnt = col[idx];
                if (tchs[jock].count(cnt)) {
                    int cmp = find_set(tchs[jock][cnt], parent);
                        merge_party(cmp, idx, parent, adj, col, cnt_comp, Q, rmvd, tchs);
                    tchs[jock][cnt] = find_set(cmp, parent);
                } else {
                    tchs[jock][cnt] = idx;
                    adj[idx].insert(jock);
                }
            }
        }
        adj[jock].clear();
    }

    bool ok = true;
    for (int c = 1; c <= k; ++c) {
        if (!rmvd[c]) {
            ok = false;
            break;
        }
    }

    if (ok) cout << "TAK" << "\n";
    else cout << "NIE"<<"\n";
}

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

    int t;
    cin >> t;
    while (t--) {
        int n, m, k;
        cin >> n >> m >> k;
        vector<int> col(n + 1);
        for (int i = 1; i <= n; ++i) cin >> col[i];

        vector<pair<int, int>> e(m);
        for (int i = 0; i < m; ++i) cin >> e[i].first >> e[i].second;
        solution(n, m, k, col, e);
    }
    return 0;
}