#include<cstdio>

#include<algorithm>

#include<cstring>

#include<iostream>

#include<cmath>

#include<cctype>

#include<set>

#include<queue>

#include<vector>

#include<map>

using namespace std;

typedef long long LL;

inline int read() {

    int x=,f=;char ch=getchar();for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-;

    for(;isdigit(ch);ch=getchar())x=x*+ch-'';return x*f;

}

const int N = ;

struct Edge{ int to, nxt; } e[N << ];

int head[N], dfn[N], low[N], bel[N], sk[N], top, Index, tot, En;

bool vis[N];

inline void add_edge(int u,int v) {

    ++En; e[En].to = v, e[En].nxt = head[u]; head[u] = En;

}

void tarjan(int u) {

    low[u] = dfn[u] = ++Index;

    sk[++top] = u; vis[u] = ;

    for (int i = head[u]; i; i = e[i].nxt) {

        int v = e[i].to;

        if (!dfn[v]) {

            tarjan(v);

            low[u] = min(low[u], low[v]);

        }

        if (vis[v]) low[u] = min(low[u], dfn[v]);

    }

    if (low[u] == dfn[u]) {

        ++tot;

        do {

            vis[sk[top]] = ;

            bel[sk[top]] = tot;

            top --;

        } while (sk[top + ] != u);

    }

}

int main() {

    int n = read(), m = read(), k = read();

    for (int u, v, i = ; i <= m; ++i) {

        u = read(), v = read();

        add_edge(u + n, v);add_edge(v + n, u);

    }

    for (int i = ; i <= n; ++i) // A[i]=1,S[i]=1

        add_edge(i, i +  * n), add_edge(i +  * n, i + n);

    for (int cnt, now, last, i = ; i <= k; ++i) {

        cnt = read(), last = read();

        for (int j = ; j <= cnt; ++j) {

            now = read();

            add_edge(last +  * n, now +  * n);add_edge(now +  * n, last +  * n); // S[i-1]=1,S[i]=1

            add_edge(now, last +  * n); add_edge(last +  * n, now + n); // A[i]=1,S[i-1]=0

            last = now;

        }

    }

    for (int i = ; i <= (n << ); ++i) if (!dfn[i]) tarjan(i);

    for (int i = ; i <= n; ++i) {

        if (bel[i] == bel[i + n] || bel[i +  * n] == bel[i +  * n]) {

            puts("NIE"); return ;

        }

    }

    puts("TAK");

    return ;

}