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
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

////// kod pochodzi z tego bloga: https://codeforces.com/blog/entry/62393
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
///////

int color[100003];
vi color_ls[100003];
bool is_del[100003];
vi graph[100003];

int rep_[100003];
int siz_[100003];
int rep2[100003];
unordered_map<ll,int,custom_hash> mp[100003];
vi del_ls;

int fint(int v)
{
    if(rep_[v] == v) return v;
    return rep_[v] = fint(rep_[v]);
}

void onion(int a, int b)
{
    a = fint(a);
    b = fint(b);
    if(a == b) return;
    rep_[a] = b;
    siz_[b] += siz_[a];
    if(siz(color_ls[color[b]]) == siz_[b]) forall(it,color_ls[color[b]]) del_ls.pb(it);
}

int fint2(int v)
{
    if(rep2[v] == v) return v;
    return rep2[v] = fint2(rep2[v]);
}

void onion2(int a, int b)
{
    a = fint2(a);
    b = fint2(b);
    if(a == b) return;
    if(siz(mp[a]) > siz(mp[b])) swap(a,b);
    rep2[a] = b;
    forall(it,mp[a])
    {
        if(mp[b].find(it.ff) != mp[b].end()) onion(it.ss,mp[b][it.ff]);
        else mp[b][it.ff] = it.ss;
    }   
}

void solve()
{
    int n,m,k;
    cin >> n >> m >> k;
    del_ls = {};
    rep2(i,1,n) cin >> color[i];
    rep2(i,1,k) color_ls[i] = {};
    rep2(i,1,n) 
    {
        color_ls[color[i]].pb(i);
        graph[i] = {};
        is_del[i] = 0;
        rep_[i] = i;
        siz_[i] = 1;
        mp[i] = {};
        rep2[i] = i;
    }
    rep2(i,1,n) if(siz(color_ls[color[i]]) == 1) del_ls.pb(i);
    rep(i,m)
    {
        int a,b;
        cin >> a >> b;
        graph[a].pb(b);
        graph[b].pb(a);
        if(color[a] == color[b]) onion(a,b);
    }
    int cnt = 0;
    while(!del_ls.empty())
    {
        int v = del_ls.back();
        del_ls.pop_back();
        cnt++;
        is_del[v] = 1;
        forall(it,graph[v]) 
        {
            if(is_del[it]) onion2(v,it);
            else
            {
                int v2 = fint2(v);
                if(mp[v2].find(color[it]) != mp[v2].end()) onion(it,mp[v2][color[it]]);
                else mp[v2][color[it]] = it;
            }
        }
    }
    if(cnt == n) cout << "TAK\n";
    else cout << "NIE\n";
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    int t = 1;
    cin >> t;
    while(t--) solve();
}