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

struct FindUnion {
    vector<int> par, rnk;
    FindUnion(int n) : par(n), rnk(n, 0) { 
        for (int i = 0; i < n; i++) 
            par[i] = i;
    }
    int find(int x) {
        while (par[x] != x) {
            par[x] = par[par[x]];
            x = par[x];
        }
        return x;
    }
    
    pair<int,int> merge(int a, int b) {
        a = find(a); 
        b = find(b);
        if (a == b) 
            return {-1, -1};
        if (rnk[a] < rnk[b]) 
            swap(a, b);
        par[b] = a;
        if (rnk[a] == rnk[b]) 
            rnk[a]++;
        return {a, b};
    }
};

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

    int t;
    cin >> t;
    while (t--) {
        int n, m, k;
        cin >> n >> m >> k;

        vector<int> a(n);
        for (int& x : a) 
        {
             cin >> x; x--; 
        }

        vector<vector<int>> adj(n);
        vector<pair<int,int>> edges(m);
        for (int i = 0; i < m; i++) {
            int u, v;
            cin >> u >> v;
            u--; 
            v--;
            edges[i] = {u, v};
            adj[u].push_back(v);
            adj[v].push_back(u);
        }

        vector<vector<int>> party(k);
        for (int i = 0; i < n; i++) 
            party[a[i]].push_back(i);

        FindUnion funion(n);
        // FU root -> partia
        vector<set<int>> rp(n);
        for (int i = 0; i < n; i++) 
            rp[i].insert(a[i]);

        // spojne skladowe
        vector<int> nc(k);
        for (int p = 0; p < k; p++) 
            nc[p] = party[p].size();

        // #1 sklejanie grafu wewnatrz partii
        for (auto [u, v] : edges) {
            if (a[u] != a[v]) continue;
            auto [nr, ar] = funion.merge(u, v);
            if (nr == -1) continue;
            nc[a[u]]--;
            // bubble
            if (rp[nr].size() < rp[ar].size()) swap(rp[nr], rp[ar]);
            for (int p : rp[ar]) rp[nr].insert(p);
            rp[ar].clear();
        }

        // #2 Wycinanie partii
        queue<int> q;
        vector<bool> peeled(k, false);
        for (int p = 0; p < k; p++) {
            if (nc[p] <= 1) {
                 q.push(p); peeled[p] = true; 
            }
        }

        int cnt = 0;
        while (!q.empty()) {
            int p = q.front(); 
            q.pop();
            cnt++;
            for (int u : party[p]) 
            {
                for (int v : adj[u]) 
                {
                    auto [nr, ar] = funion.merge(u, v);
                    if (nr == -1) continue;
                    
                    if (rp[nr].size() < rp[ar].size()) swap(rp[nr], rp[ar]);
                    for (int pp : rp[ar]) 
                    {
                        if (rp[nr].count(pp)) 
                        {
                            if (!peeled[pp]) 
                            {
                                nc[pp]--;
                                if (nc[pp] == 1) 
                                { 
                                    q.push(pp); 
                                    peeled[pp] = true; 
                                }
                            }
                        } else {
                            rp[nr].insert(pp);
                        }
                    }
                    rp[ar].clear();
                }
            }
        }

        // jesli obrlismy wszystko

        cout << (cnt == k ? "TAK" : "NIE") << "\n";
    }

    return 0;
}