#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i,a,n) for (int i = a; i < n; i++)
#define repn(i,a,n) for (int i = a; i <= n; i++)
#define per(i,a,n) for (int i = (n) - 1; i >= a; i--)
#define pern(i,a,n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 1100000;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int T, n, k, m, pp[N], ans[N], cp[N], a[N], b[N];
int main() {
	IO;
	cin >> T;
	while (T--) {
		cin >> n >> k;
		repn(i, 1, n) pp[i] = cp[i] = 0;
		repn(i, 1, k) cin >> a[i] >> b[i];
		cin >> m;
		pern(i, 1, m) {
			int x;
			cin >> x;
			cp[x] = 1;
		}
		pern(i, 1, k) {
			if (!cp[b[i]]) {
				ans[i] = 0;
				continue;
			}
			if (!cp[a[i]]) {
				if (!pp[b[i]]) pp[b[i]] = 1, ans[i] = 1;
				else ans[i] = 0;
				continue;
			}
			if (!pp[a[i]]) ans[i] = 0;
			else {
				if (!pp[b[i]]) pp[b[i]] = 1, ans[i] = 1;
				else ans[i] = 0;
			}
		}
		int flag = 0;
		repn(i, 1, n) if (cp[i] && !pp[i]) flag = 1;
		if (flag) cout << "NIE\n";
		else {
			cout << "TAK\n";
			repn(i, 1, k) if (ans[i]) cout << "T"; else cout << "N";
			cout << "\n";
		}
	}
			
	return 0;
}