#include <iostream>

using namespace std;

typedef struct Node {
    int n;
    struct Node* next;
} Node;

void dfs(Node** graph, int* components, int n, int i, int component_no) {
    if(components[i] == -1) components[i] = component_no;
    Node *tmp = graph[i];
    while(tmp != NULL) {
        if(components[tmp->n] == -1) dfs(graph, components, n, tmp->n, component_no);
        tmp = tmp->next;
    }
    // traverse the graph and mark all nodes which belong to the component
}

int* count_components(Node** graph, int n) {
    // this array shows to which component each node belongs
    // -1 means that node hasn't been visited yet
    int* components = new int[n];
    int component_no = 0;
    for(int i=0; i<n; i++) components[i] = -1;
    // prepare components counter
    for(int i=0; i<n; i++) {
        if(components[i] == -1) dfs(graph, components, n, i, component_no++);
    }
    // in loop: find unvisited node, call DFS/BFS

    return components;
}

int main() {
    int n, k, p;
    cin >> n;
    Node **graph = new Node*[n];
    cin >> k;
    cin >> p;
    for (int i=0; i<k; i++) {
        Node *tmp1 = new Node, *tmp2 = new Node;
        int x, y;
        cin >> x;
        cin >> y;
        tmp1->n = y;
        tmp1->next = graph[x];
        graph[x] = tmp1;
        tmp2->n = x;
        tmp2->next = graph[y];
        graph[y] = tmp2;
    }
    int* components = count_components(graph, n);
    for (int i=0; i<p; i++) {
        int x, y;
        cin >> x;
        cin >> y;
        cout << (components[x] == components[y] ? "TAK" : "NIE") << endl;
    }
}