#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e16;
int n, m, u;
vector<vector<pair<int, int>>> adj;
vector<vector<int>> dist;
signed main(){
cin >> n >> m >> u;
adj.resize(n);
vector<vector<int>> dist(n, vector<int>(n, INF));
for(int i = 0; i < m; i++){
int a, b, t;
cin >> a >> b >> t; a--; b--;
adj[a].push_back({b, t});
adj[b].push_back({a, t});
dist[a][b]=t;
}
for(int a = 0; a < n; a++){
for(int b = 0; b < n; b++){
if(a==b)continue;
for(int k = 0; k < n; k++){
if(a==k || b==k)continue;
dist[a][b] = min(dist[a][b], max(dist[a][k], dist[k][b]));
}
}
}
for(int q = 0; q < u; q++){
int a, b, p;
cin >> a >> b >> p; a--; b--;
if(dist[a][b] <= p){
cout << "TAIP\n";
}
else{
cout << "NE\n";
}
}
}
