#include <bits/stdc++.h>

#define maxn 100005

using namespace std;

int n, k, m;
int a[maxn];
int b[maxn];

int s[maxn];
int t[maxn];
int res[maxn];

int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		int n, k;
		scanf("%d%d", &n, &k);
		for (int i = 1; i <= k; i++) {
			scanf("%d%d", &a[i], &b[i]);
		}
		scanf("%d", &m);
		for (int i = 1; i <= m; i++) {
			int x;
			scanf("%d", &x);
			s[x] = 1;
		}
		bool flg = 1;
		for (int i = k; i; i--) {
			if (s[b[i]]) {
				if (t[b[i]]) flg = 0;
				else t[a[i]] = 1, s[b[i]] = 0, res[i] = 1;
			}
		}
		for (int i = 1; i <= n; i++) if (s[i]) flg = 0;
		if (flg) {
			puts("TAK");
			for (int i = 1; i <= k; i++) putchar(res[i] ? 'T' : 'N');
			puts("");
		}
		else puts("NIE");
		for (int i = 1; i <= n || i <= k; i++) a[i] = b[i] = s[i] = t[i] = res[i] = 0;
	}
	return 0;
}