#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define fi first
#define se second
using namespace std;
vector<pair<ll,ll>> adj[10005];
ll a, b, p;
vector<bool> vis;
void dfs(int v) {
vis[v] = 1;
for (auto u : adj[v]) {
if (vis[u.fi]) continue;
if (u.se > p) continue;
vis[u.fi] = 1; dfs(u.fi);
}
}
int main() {
ll n, m, u; cin >> n >> m >> u;
for (int i = 0; i < m; i++) {
ll x, y, t; cin >> x >> y >> t;
adj[x].pb({y, t}); adj[y].pb({x, t});
}
while (u--) {
cin >> a >> b >> p;
vis.clear(); vis.resize(n+5);
dfs(a);
cout << (vis[b] ? "TAIP" : "NE") << "\n";
}
return 0;
}
