#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

mt19937 rng;
const int MAGIC = 2;
const int N = 300'447;
int val[N][MAGIC];
int ans[N][MAGIC];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, m, k;
	cin >> n >> m >> k;
	FOR (i, 0, n)
	{
		FOR (j, 0, MAGIC)
			val[i][j] = rng();
	}
	FOR (i, 0, m)
	{
		int u, v;
		cin >> u >> v;
		u--, v--;
		FOR (j, 0, MAGIC)
		{
			ans[u][j] ^= val[v][j];
			ans[v][j] ^= val[u][j];
		}
	}
	FOR (i, 0, k)
	{
		int sz;
		cin >> sz;
		VI xrAll(MAGIC, 0);
		VI a(sz);
		FOR (j, 0, sz)
		{
			cin >> a[j];
			a[j]--;
			FOR (j2, 0, MAGIC)
				xrAll[j2] ^= val[a[j]][j2];
		}
		FOR (j, 0, sz)
		{
			FOR (j2, 0, MAGIC)
			{
				ans[a[j]][j2] ^= xrAll[j2] ^ val[a[j]][j2];
			}
		}
	}
	FOR (i, 0, n)
	{
		bool ok = true;
		FOR (j, 0, MAGIC)
			ok &= ans[i][j] == 0;
		cout << (ok ? "TAK" : "NIE") << '\n';
	}
	
	return 0;
}