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

void dfs1(int v,vector<bool> &vis,vector<int>&comp,vector<vector<int>> &t,int nr){
    vis[v]=true;
    comp[v]=nr;
    for (int u:t[v]){
        if (vis[u]) continue;
        dfs1(u,vis,comp,t,nr);
    }
}

void dfs2(int v,vector<bool> &vis, vector<int> &a,int win,vector<vector<int>> &t, vector<int> &sofar, vector<unordered_set<int>> &g){
    vis[v]=true;
    if (a[v]==win){
        for (int x:sofar) g[a[v]].insert(a[x]);
    } else sofar.push_back(v);

    for (int u:t[v]){
        if (vis[u]) continue;
        dfs2(u,vis,a,win,t,sofar,g);
    }
    if (!sofar.empty() && sofar.back()==v) sofar.pop_back();
}

bool solve(){
    int n,m,k;
    cin>>n>>m>>k;

    vector<vector<int>> t(n+1);
    vector<int> a(n+1);

    vector<vector<int>> v(k+1);

    for (int i=1;i<=n;i++){cin>>a[i]; v[a[i]].push_back(i);}

    for (int i=0;i<m;i++){
        int a,b;
        cin>>a>>b;
        t[a].push_back(b);
        t[b].push_back(a);
    }

    vector<int> comp(n+1,-1);
    vector<bool> vis(n+1);
    int nr=1;
    for (int i=1;i<=n;i++){
        if (!vis[i]) dfs1(i,vis,comp,t,nr++);
    }

    for (auto vec:v){
        if (vec.empty()) continue;
        int cmp=comp[vec[0]];

        for (int x:vec){
            if (comp[x]!=cmp) return false;
        }
    }

    vector<unordered_set<int>> g(k+1);
    vector<bool> did(k+1);
    for (int i=1;i<=n;i++){
        if (did[a[i]]) continue;
        vis.assign(n+1,false);
        did[a[i]]=true;
        vector<int> sofar;
        dfs2(i,vis,a,a[i],t,sofar,g);
    }



    vector<int> in(k+1);
    for (int i=1;i<=k;i++){
        for (int u:g[i]) in[u]++;
    }
    queue<int> q;
    for (int i=1;i<=k;i++){
        if (in[i]==0) q.push(i);
    }

    while (!q.empty()){
        int v=q.front();
        q.pop();

        for (int u:g[v]){
            in[u]--;
            if (in[u]==0) q.push(u);
        }
    }

    for (int i=1;i<=k;i++){
        if (in[i]!=0) return false;
    }

    return true;
}

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

    int t;
    cin>>t;

    while (t--){
        if (solve()) cout<<"TAK\n";
        else cout<<"NIE\n";
    }

    return 0;
}