#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define debug(a) cerr << #a << " = " << a << endl;
#define debug2(a, b) cerr << #a << " = " << a << " --- " << #b << " = " << b << endl;
#define debug3(a, b, c) cerr << #a << " = " << a << " --- " << #b << " = " << b << " --- " << #c << " = " << c << endl;
#define PI 3.1415926535897932384626433832795028841971
#define INF 0x3f3f3f3f
#define MAXV 1000006
#define MOD 1000000007
#define F first
#define S second
#define ms(a, b) memset(a, b, sizeof(a))
#define all(S) (S).begin(),(S).end()

using namespace std;

typedef long long int ll;
typedef pair<int, int> ii;

ll value[MAXV], sum[MAXV];
int aux[MAXV];
int main() {
  ios_base::sync_with_stdio(false);
	cin.tie(NULL);
  srand(time(NULL));
  int n, m, k;
  cin >> n >> m >> k;
  rep(i, 1, n+1)
  {
    rep(j, 0, 40)
    {
      int x = rand()%2;
      value[i] |= x*(1LL<<j);
    }
  }

  int a, b;
  while(m--)
  {
    cin >> a >> b;
    sum[a] ^= value[b];
    sum[b] ^= value[a];
  }

//  rep(i, 1, n+1)
//    debug3(i, value[i], sum[i])

  int s; 
  while(k--)
  {
    ll sumtot = 0;
    cin >> s;
    rep(i, 0, s)
    {
      cin >> aux[i];
      sumtot ^= value[aux[i]];
    }
    //debug(sumtot)

    rep(i, 0, s)
      sum[aux[i]] ^= (sumtot ^ value[aux[i]]);
  }

  rep(i, 1, n+1)
  {
    cout << (sum[i] ? "NIE" : "TAK") << endl;
    //debug(sum[i])
  }
  return 0;
}