#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 2137
#endif

const int INF = 1e9;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tt;
  cin >> tt;
  while (tt--) {
    int n, k;
    cin >> n >> k;
    vector<vector<pair<int, int>>> adj(n);
    for (int i = 0; i < k; i++) {
      int u, v;
      cin >> u >> v;
      u--; v--;
      adj[u].push_back({v, i});
    }
    int s;
    cin >> s;
    vector<bool> a(n);
    for (int i = 0; i < s; i++) {
      int u;
      cin >> u;
      a[u - 1] = true;
    }
    priority_queue<pair<int, int>> q;
    vector<int> dst(n, -1);
    for (int i = 0; i < n; i++) {
      if (!a[i]) {
        dst[i] = INF;
        q.push({dst[i], i});
      }
    }
    while (!q.empty()) {
      auto [d, u] = q.top();
      q.pop();
      if (d != dst[u]) {
        continue;
      }
      for (auto [v, i] : adj[u]) {
        if (i < dst[u] && i > dst[v]) {
          dst[v] = i;
          q.push({dst[v], v});
        }
      }
    }
    bool ok = true;
    string ans(k, 'N');
    for (int i = 0; i < n; i++) {
      if (a[i] && dst[i] == -1) {
        ok = false;
        break;
      } else if (a[i]) {
        ans[dst[i]] = 'T';
      }
    }
    if (ok) {
      cout << "TAK\n" << ans << '\n';
    } else {
      cout << "NIE\n";
    }
  }
}