#include<bits/stdc++.h>

#pragma GCC optimize ("Ofast")

using namespace std;

#define rep(i,a,b) for(ll i = a; i<b;i++)
#define rrep(i,a,b) for(ll i = b-1; i>=a;i--)
#define trav(x,a) for(auto &x: a)
#define all(v) v.begin(),v.end()
#define sz(v) ll(v.size())

typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;

void solve(){
    ll n,m;
    cin>>n>>m;

    vector<vector<pll>> e(n);
    rep(i,0,m){
        ll a,b;
        cin>>a>>b;
        --a; --b;
        e[a].emplace_back(i,b);   
    }
    rep(i,0,n) {
        reverse(all(e[i]));
    }
    vl d(n);
    ll k; cin>>k;
    rep(i,0,k){
        ll x; cin>>x;
        d[x-1] = 1;
    }

    vl killedFrom(n,-1);

    function<void(ll,ll)> dfs = [&](ll v,ll f){
        killedFrom[v] = max(killedFrom[v], f);
        while(e[v].size()){
            auto [ei,u] = e[v].back();
            if(ei<f){
                e[v].pop_back();
                dfs(u,ei);
            } else break;
        }
    };

    rep(i,0,n){
        if(!d[i]){
            dfs(i,m);
        }
    }
    vl ans(m);
    rep(i,0,n){
        if(d[i]){
            if(killedFrom[i]==-1){
                cout<<"NIE\n";
                return;
            }

            ans[killedFrom[i]] = 1;
        }
    }
    cout<<"TAK\n";
    rep(i,0,m){
        if(ans[i]) cout<<"T";
        else cout<<"N";
    }
    cout<<"\n";
}

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

    ll t; cin>>t;
    while(t--)
        solve();
}