#include <iostream>
#include <vector>
#include <cmath>
#include <unordered_map>

using namespace std;

struct vertex
{
    vector<int> neighbours;
    vector<int> results;
    bool visited = 0;
};

bool ifEdge(vector<vertex>& g, int v, int w)
{
    if (find(g[v].neighbours.begin(), g[v].neighbours.end(), 0) != g[v].neighbours.end())
        return true;
    else
        return false;
}

void input(vector<vertex>& g)
{
    int n, m;
    cin >> n >> m;

    g.assign(n + 1, vertex());

    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;

        g[a].neighbours.push_back(b);
        g[b].neighbours.push_back(a);
    }
}

bool solve(vector<vertex>& g, vector<vector<int>>& r, int s, int v)
{
    if (r[v][s] != -1)
        return r[v][s];

    if (s == 0)
        return r[v][s] = ifEdge(g, v, 0);

    for (int i = 0; i < g[v].neighbours.size(); i++)
        if (ifEdge(g, v, g[v].neighbours[i]) && solve(g, r, s - 1 << g[v].neighbours[i], g[v].neighbours[i]))
            return r[v][s] = true;

    return r[v][s] = false;
}

int main()
{
    int z;
    cin >> z;

    while (z--)
    {
        vector<vertex> graph;
        vector<vector<int>> results;
        int s;

        input(graph);

        s = 1 << (graph.size() + 1);
        results.assign(graph.size(), vector<int>(s + 1, -1));

        solve(graph, results, s - 1, 0);

        if (results[0][s - 1])
            cout << "TAK" << endl;
        else
            cout << "NIE" << endl;
    }

    return 0;
}