#include <bits/stdc++.h>
#define N 300000
using namespace std;vector <int> bi[N], bn[N];
int T, n, m;
int ai[N];
int nx[N], ne[N], nl[N], tot;
int vis[N], td[N], tt[N], col[N];
int tmp;
void dfs1(int t, int c)
{vis[t] = c;for (int i = 0; i < bi[t].size(); ++ i)if (!vis[bi[t][i]]) dfs1(bi[t][i], c);
}
int solve2(int t);
int solve1(int t)
{int nw = tmp + 1;for (int p = t; p; p = nx[p]) vis[p] = 0;for (int p = t; p; p = nx[p])if (!vis[p])dfs1(p, vis[p] = ++ tmp);for (int p = t; p; p = nx[p]){if (!tt[vis[p]]) tt[vis[p]] = td[vis[p]] = p;else{nx[td[vis[p]]] = p;td[vis[p]] = p;}}for (int i = nw; i <= tmp; ++ i){nx[td[i]] = 0;if (!solve2(tt[i])) return 0;}return 1;
}
set <int> S[N];
int test(int a, int b)
{return S[a].count(b);
}
int solve2(int t)
{if (nx[t] == 0) return 1;for (int p = t; p; p = nx[p]) ne[p] = nx[p], nl[p] = p;for (int p = t; p; p = ne[p]) nx[p] = 0;for (int p = t; p; p = ne[p]){for (int a = p; a; a = nx[a]){for (int q = ne[p], c = p; q; ){int bo = 0;for (int b = q; b; b = nx[b])if (!test(a, b)){bo = 1;goto haha;}haha:if (bo){nx[nl[p]] = q;nl[p] = nl[q];nl[q] = 0;ne[c] = ne[q];ne[q] = 0;q = ne[c];}else{c = ne[c];q = ne[q];}}}}if (ne[t] == 0) return 0;for (int p = t; p; p = ne[p])for (int q = p; q; q = nx[q])col[q] = p, bn[q].clear();for (int p = t; p; p = ne[p])for (int q = p; q; q = nx[q])for (int a = 0; a < bi[q].size(); ++ a)if (col[bi[q][a]] == col[q]) bn[q].push_back(bi[q][a]);for (int p = t; p; p = ne[p])for (int q = p; q; q = nx[q])bi[q] = bn[q];vector <int> nls;for (int p = t; p; p = ne[p]) nls.push_back(p);for (int p = 0; p < nls.size(); ++ p)if (!solve1(nls[p])) return 0;return 1;
}
int main()
{//freopen("C.in", "r", stdin);scanf("%d", &T);while (T --){scanf("%d%d", &n, &m);for (int i = 1; i <= m; ++ i){int a, b;scanf("%d%d", &a, &b);bi[a].push_back(b); S[a].insert(b);bi[b].push_back(a); S[b].insert(a);}for (int i = 1; i < n; ++ i) nx[i] = i + 1, ne[i] = 0;nx[n] = 0;if (solve1(1)) puts("TAK"); else puts("NIE");for (int i = 1; i <= n; ++ i) bi[i].clear(), S[i].clear();}
}