//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
template<class T>
using vec = vector<T>;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KoRoVa
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = 1e5 + 11, inf = 1000111222;



struct dsu {
public:
    int n;
    vector <int> p, cnt;

    inline void make_set (int v) {
        p[v] = v;
    }

    dsu (int n) : n(n) {
        p.resize(n);
        cnt.assign(n, 1);
        for (int i = 0; i < n; i++) {
            make_set(i);
        }
    }

    inline int get (int v) {
        if (p[v] == v) return v;
        return p[v] = get(p[v]); /// compressing path
    }

    inline bool unite (int a, int b) {
        a = get(a);
        b = get(b);
        if (a == b) return false;
        if (cnt[a] > cnt[b]) {
            swap(a, b);
        }
        p[a] = b;
        cnt[b] += cnt[a];
        return true;
    }
};

int a[max_n];





void test_case() {
    int n, m, k;
    cin >> n >> m >> k;
    vector <int> cnt(k);
    vector <vector <int> > have(k);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        --a[i];
        ++cnt[a[i]];
        have[a[i]].pb(i);

    }
    vector <vector <int> > edge(n);
    for (int i = 0, u, v; i < m; i++) {
        cin >> u >> v;
        --u, --v;
        edge[u].pb(v);
        edge[v].pb(u);
    }
    dsu t(n);
    queue <int> q;
    auto check = [&] (int u, int v) {
        if (t.unite(u, v)) {
            --cnt[a[v]];
            if (cnt[a[v]] == 1) {
                q.push(a[v]);
            }
        }
    };
    for (int i = 0; i < k; i++) {
        if (cnt[i] <= 1) {
            q.push(i);
        }
    }
    for (int i = 0; i < n; i++) {
        for (int to : edge[i]) {
            if (a[i] == a[to]) {
                check(i, to);
            }
        }
    }
    int gg = 0;
    vector <int> alive(n, 1);
    vector <map <int, int> > cmp(n);
    vector <int> p(n);
    for (int i = 0; i < n; i++) {
        p[i] = i;
    }
    auto get_p = [&] (int v) {
        int V = v;
        while (p[v] != v) {
            v = p[v];
        }
        while (p[V] != V) {
            int to = p[V];
            p[V] = v;
            V = to;
        }
        return v;
    };
    auto add = [&] (int v, int to) {
        v = get_p(v);
        if (!cmp[v].count(a[to])) {
            cmp[v][a[to]] = to;
        }
        else {
            check(cmp[v][a[to]], to);
        }
    };
    auto _merge = [&] (int a, int b) {
        a = get_p(a);
        b = get_p(b);
        if (a == b) {
            return;
        }
        if (len(cmp[a]) < len(cmp[b])) {
            swap(a, b);
        }
        p[b] = a;
        for (auto &x : cmp[b]) {
            add(a, x.second);
        }
        cmp[b].clear();
    };
    while (!q.empty()) {
        int color = q.front();
        ++gg;
        q.pop();
        for (int v : have[color]) {
            alive[v] = 0;
            for (int to : edge[v]) {
                if (alive[to]) {
                    add(v, to);
                }
                else {
                    _merge(v, to);
                }
            }
        }
    }

    if (gg == k) {
        cout << "TAK\n";
    }
    else {
        cout << "NIE\n";
    }
}



int main() {
//    freopen("test.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);


    int t = 1;

     cin >> t;

    while (t--) test_case();

    return 0;
}

/*
KoRoVa!
*/