#ifdef MY_LOCAL
#include "D://competitive_programming/debug/debug.h"
#define debug(x) cerr << "[" << #x<< "]:"<<x<<"\n"
#else
#define debug(x) 
#endif
#define REP(i, n) for(int i = 0; i < (n); i ++)
#define REPL(i,m, n) for(int i = (m); i < (n); i ++)
#define SORT(arr) sort(arr.begin(), arr.end())
#define LSOne(S) ((S)&-(S))
#define sz(X) ((int)X.size())
#define READ(arr) for(auto &a: arr){cin>>a;}
#define SUM(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef tree<int,null_type,less<int>, rb_tree_tag, tree_order_statistics_node_update> ost;
const ll INF = 1e18;
void solve() {
	int n,k;cin>>n>>k;
	vii kill(k);
	REP(i, k) {
		int a,b;cin>>a>>b;a--;b--;
		kill[i] = {a,b};
	}
	vi todie(n);
	int s;cin>>s;
	REP(i, s) {
		int y;cin>>y;y--;
		todie[y] = 1;
	}
	vi deadfish(n);
	vi deathdays(k,0);
	for (int idx = k-1; idx >=0; idx--) {
		auto [a,b] = kill[idx];
		if (!todie[b] || deadfish[b]) continue;
		if (!todie[a] && !deadfish[b]) {
			deadfish[b] = 1;
			deathdays[idx] = 1;
		} else {
			if (deadfish[a] == 1) {
				deadfish[b] = 1;
				deathdays[idx] = 1;
			}
		}
	}
	REP(i, n) {
		if (todie[i] && !deadfish[i]) {
			cout<<"NIE\n";return;
		}
	}
	cout<<"TAK\n";
	REP(i, k) {
		if (deathdays[i]) {
			cout<<"T";
		} else {
			cout<<"N";
		}
	}
	cout<<"\n";return;

}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	int tc;
	cin>>tc;
	REP(i, tc) {
		solve();
	}

}