#include <bits/stdc++.h>
// #include <bits/extc++.h>
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;
using i64 = long long;
using namespace std;
const int N = 1e6 + 5;
// const int B = 500;
// const int M = 50005;
// const int base = 17131;
const int mod = 998244353;
// const int mod = 1e9 + 7;
// const double pi = acos(-1);

/*
1
3 4
3 1
3 2
2 1
1 2
2
1 2
*/
int n, k, a[N], b[N];
void solve()
{
    cin >> n >> k;
    for (int i = 1; i <= k; i++)
        cin >> a[i] >> b[i];
    int s;
    cin >> s;
    set<int> vis, killed, protect;
    for (int i = 1, x; i <= s; i++)
        cin >> x, vis.insert(x);
    vector<int> tmp;
    for (int i = k; i >= 1; i--)
    {
        if (vis.count(b[i]) && !vis.count(a[i]))
        {
            tmp.push_back(i);
            vis.erase(b[i]);
            protect.insert(a[i]);
        }
    }
    reverse(tmp.begin(), tmp.end());
    if (tmp.size() != s)
    {
        cout << "NIE\n";
        return;
    }
    string ans;
    for (int i = 1, j = 0; i <= k; i++)
    {
        if (tmp[j] == i)
        {
            if (killed.count(a[i]))
            {
                cout << "NIE\n";
                return;
            }
            killed.insert(b[i]);
            ans.push_back('T');
            j++;
        }
        else
            ans.push_back('N');
    }
    cout << "TAK\n";
    cout << ans << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    cout << fixed << setprecision(12);
    while (t--)
        solve();
}