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

using namespace std;

typedef long long ll;

vector<int> G[100010];
vector<int> AG[100010];
int vis[100010];
int SN[100010];
int A[100010];
int AA[100010];
int C[100010];
int Q[300003];
set<int> SC[100010];
int SSS[100010];
int SFA[100010];

void bfs(int v) {
    int b = 0, e = 0;
    Q[e++] = v;
    while (b < e) {
        int p = Q[b++];
        vis[p] = 1;
        for (int i = 0; i < G[p].size(); i++) {
            int next = G[p][i];
            if (vis[next]) continue;
            if (A[next] == A[p]) {
                C[next] = C[p];
                Q[e++] = next;
            } else {
                AG[A[p]].push_back(next);
                AG[A[next]].push_back(p);
            }
        }
    }
}

void sss(int v) {
    int b = 0, e = 0;
    Q[e++] = v;
    while (b < e) {
        int p = Q[b++];
        vis[p] = 1;
        for (int i = 0; i < G[p].size(); i++) {
            int next = G[p][i];
            if (vis[next]) continue;
            SSS[next] = SSS[p];
            Q[e++] = next;
        }
    }
}

void go() {
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 0; i <= n; i++) {
        G[i].clear();
        vis[i] = 0;
        C[i] = 0;
        SSS[i] = 0;
    }
    for (int i = 0; i <= k; i++) {
        SN[i] = 0;
        AA[i] = 0;
        SFA[i] = 0;
        SC[i].clear();
        AG[i].clear();
    }

    int u, v;
    for (int i = 0; i < n; i++) cin >> A[i];
    for (int i = 0; i < m; i++) {
        cin >> u >> v;
        u--;
        v--;
        G[v].push_back(u);
        G[u].push_back(v);
    }
    int ssc = 0;
    for (int i = 0; i < n; i++) {
        if (vis[i]) continue;
        ssc++;
        SSS[i] = ssc;
        sss(i);
    }
    for (int i = 0; i < n; i++) {
        if (SFA[A[i]] && SSS[i] != SFA[A[i]]) {
            cout << "NIE" << "\n";
            cout.flush();
            return;
        }
        SFA[A[i]] = SSS[i];
    }

    for (int i = 0; i < n; i++) { vis[i] = 0; }
    for (int i = 0; i < n; i++) {
        if (vis[i]) continue;
        SN[A[i]]++;
        C[i] = SN[A[i]];
        bfs(i);
    }
    int b = 0, e = 0;
    for (int i = 0; i < n; i++) {
        if (SN[A[i]] == 1 && !AA[A[i]]) {
            Q[e++] = A[i];
            AA[A[i]] = 1;
        }
    }
    while (b < e) {
        int p = Q[b++];
        for (int i = 0; i < AG[p].size(); i++) {
            int next = AG[p][i];
            SC[A[next]].insert(C[next]);
            if (SC[A[next]].size() == SN[A[next]] && !AA[A[next]]) {
                Q[e++] = A[next];
                AA[A[next]] = 1;
            }
        }
    }

    int ok = 1;
    for (int i = 1; i <= k; i++) { ok &= AA[i] || SN[i] <= 1; }
    cout << (ok ? "TAK" : "NIE") << "\n";
    cout.flush();
}

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

    int t;
    cin >> t;
    while (t--) {
        go();
    }
    return 0;
}