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 <iostream>
#include <vector>
#include <map>
#include <queue>

using namespace std;

void solve() {
    int n, m, k;
    if (!(cin >> n >> m >> k)) return;
    
    vector<int> color(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> color[i];
    }
    
    vector<vector<int>> adj(n + 1);
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    
    // DSU utrzymujące spójne składowe poszczególnych partii
    vector<int> parent_d(n + 1);
    vector<int> size_d(n + 1, 1);
    for (int i = 1; i <= n; i++) parent_d[i] = i;
    
    auto find_dsu_d = [&](auto& self, int i) -> int {
        if (parent_d[i] == i) return i;
        return parent_d[i] = self(self, parent_d[i]);
    };
    
    for (int u = 1; u <= n; u++) {
        for (int v : adj[u]) {
            if (u < v && color[u] == color[v]) {
                int ru = find_dsu_d(find_dsu_d, u);
                int rv = find_dsu_d(find_dsu_d, v);
                if (ru != rv) {
                    if (size_d[ru] < size_d[rv]) swap(ru, rv);
                    parent_d[rv] = ru;
                    size_d[ru] += size_d[rv];
                }
            }
        }
    }
    
    vector<int> cnt(k + 1, 0);
    for (int i = 1; i <= n; i++) {
        if (parent_d[i] == i) {
            cnt[color[i]]++;
        }
    }
    
    int visible_colors = 0;
    queue<int> Q;
    for (int i = 1; i <= k; i++) {
        if (cnt[i] > 0) {
            visible_colors++;
            if (cnt[i] == 1) {
                Q.push(i);
            }
        }
    }
    
    vector<vector<int>> nodes_of_color(k + 1);
    for (int i = 1; i <= n; i++) {
        nodes_of_color[color[i]].push_back(i);
    }
    
    // DSU utrzymujące komponenty z odmalowanych wierzchołków
    vector<int> parent_u(n + 1);
    for (int i = 1; i <= n; i++) parent_u[i] = i;
    auto find_u = [&](auto& self, int i) -> int {
        if (parent_u[i] == i) return i;
        return parent_u[i] = self(self, parent_u[i]);
    };
    
    vector<map<int, int>> adj_u(n + 1);
    vector<bool> in_U(n + 1, false);
    
    auto merge_U = [&](int x, int y) {
        x = find_u(find_u, x);
        y = find_u(find_u, y);
        if (x == y) return;
        // Optymalizacja łączenia mniejszego do większego (small-to-large merging)
        if (adj_u[x].size() < adj_u[y].size()) {
            swap(x, y);
        }
        parent_u[y] = x;
        for (auto& pair : adj_u[y]) {
            int d = pair.first;
            int root_y = find_dsu_d(find_dsu_d, pair.second);
            if (adj_u[x].count(d)) {
                int root_x = find_dsu_d(find_dsu_d, adj_u[x][d]);
                if (root_x != root_y) {
                    if (size_d[root_x] < size_d[root_y]) swap(root_x, root_y);
                    parent_d[root_y] = root_x;
                    size_d[root_x] += size_d[root_y];
                    cnt[d]--;
                    if (cnt[d] == 1) Q.push(d); // Partia scaliła się w jeden element -> do sprawdzenia
                    adj_u[x][d] = root_x;
                } else {
                    adj_u[x][d] = root_x;
                }
            } else {
                adj_u[x][d] = root_y;
            }
        }
        adj_u[y].clear();
    };
    
    int processed_colors = 0;
    while (!Q.empty()) {
        int c = Q.front();
        Q.pop();
        processed_colors++;
        
        for (int u : nodes_of_color[c]) {
            in_U[u] = true;
            for (int v : adj[u]) {
                if (in_U[v]) {
                    merge_U(u, v);
                } else {
                    int d = color[v];
                    int root_v = find_dsu_d(find_dsu_d, v);
                    int R = find_u(find_u, u);
                    if (adj_u[R].count(d)) {
                        int root_R = find_dsu_d(find_dsu_d, adj_u[R][d]);
                        if (root_R != root_v) {
                            if (size_d[root_R] < size_d[root_v]) swap(root_R, root_v);
                            parent_d[root_v] = root_R;
                            size_d[root_R] += size_d[root_v];
                            cnt[d]--;
                            if (cnt[d] == 1) Q.push(d);
                            adj_u[R][d] = root_R;
                        } else {
                            adj_u[R][d] = root_R;
                        }
                    } else {
                        adj_u[R][d] = root_v;
                    }
                }
            }
        }
    }
    
    if (processed_colors == visible_colors) cout << "TAK\n";
    else cout << "NIE\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int t;
    if (cin >> t) {
        while (t--) {
            solve();
        }
    }
    return 0;
}