#include "bits/stdc++.h"
 
using namespace std;

template<typename _T> void _debug(const char *s, _T x){ cerr << s << " = " << x << "\n";}
template<typename _T, typename... R> void _debug(const char *s, _T x, R... r){ while(*s != ',') cerr << *s++; cerr << " = " << x << ", "; _debug(s + 1, r...);}
 
#define debug(...)  _debug(#__VA_ARGS__,  __VA_ARGS__)
 
#define sz(s)   int32_t(s.size())
#define all(x)  begin(x), end(x)
#define getuniqe(x) x.erase(unique(all(x)), end(x))
#define X first
#define Y second
 
using ll = long long;
using ld = long double;

#define int ll

const int N = 1e6 + 5;

bool to_kill[N], will_be_killed[N], is_killed[N];

void solve() {
    int n, k;   cin >> n >> k;
    vector<int> a(k), b(k);
    for (int i = 0; i < k; i++) {
        cin >> a[i] >> b[i];
    }
    int s;  cin >> s;
    vector<int> vec(s);
    for (int i = 0; i < s; i++) {
        cin >> vec[i];
        to_kill[vec[i]] = true;
    }
    string res;
    for (int i = k - 1; i >= 0; i--) {
        if ((to_kill[a[i]] && to_kill[b[i]]) || (!to_kill[a[i]] && to_kill[b[i]])) {
            if (will_be_killed[b[i]]) res += 'N';
            else {
                will_be_killed[b[i]] = true;
                res += 'T';
            }
        } else res += 'N';
    }
    reverse(all(res));
    for (int i = 0; i < k; i++) {
        if (res[i] == 'N')  continue;
        else if (is_killed[a[i]] || is_killed[b[i]]) continue;
        else is_killed[b[i]] = true;
        
    }
    bool ok = true;
    for (int x: vec) ok &= is_killed[x];
    if (ok)  cout << "TAK\n" << res << "\n";
    else cout << "NIE\n";
    for (int x: vec)    is_killed[x] = to_kill[x] = will_be_killed[x] = false;
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int tests = 1;  cin >> tests;
    for (int test_case = 1; test_case <= tests; test_case++) {
        solve();
    }
}