#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define ll long long
//cin.tie(0);ios_base::sync_with_stdio(0);
const int MAXN = 5005;
vector<int> adjList[MAXN];
short paths[MAXN][MAXN][2];
int main() {
cin.tie(0);ios_base::sync_with_stdio(0);
int n, m, k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
paths[i][j][0] = 5001;
paths[i][j][1] = 5001;
}
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
paths[a][a][0] = 0;
paths[b][b][0] = 0;
adjList[a].push_back(b);
adjList[b].push_back(a);
}
queue<pair<int, int>> q;
for (int i = 0; i < n; i++) {
q.push({ i, 0 });
while (q.size() > 0) {
int cur = q.front().first;
int num = q.front().second;
q.pop();
for (auto j : adjList[cur]) {
if (paths[i][j][(num + 1) % 2] == -1 || paths[i][j][(num + 1) % 2] > num + 1) {
q.push({ j, num + 1 });
paths[i][j][(num + 1) % 2] = num + 1;
}
}
}
}
for (int i = 0; i < k; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
if (paths[a][b][c%2] == 5001 || c < paths[a][b][c % 2]) {
cout << "NIE" << endl;
}
else {
cout << "TAK" << endl;
}
}
}
