#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
struct DSU{
int n;
vector<int> parent, sz;
vector<vector<pair<int,int>>> chain;
DSU(int _n){
n = _n;
parent.resize(n+1); sz.resize(n+1, 1);
chain.resize(n+1);
for(int i = 0; i<=n; ++i) {
parent[i] = i;
chain[i].push_back(make_pair(-1, i));
}
}
int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
bool same_set(int u, int v){return find_set(u) == find_set(v);}
bool join_set(int u, int v, int w){
u = find_set(u), v = find_set(v);
if (u != v){
if (sz[u] < sz[v]) swap(u, v);
parent[v] = u;
sz[u] += sz[v];
chain[v][0].first = w;
for(pair<int, int> i: chain[v])
chain[u].push_back(i);
return true;
}
return false;
}
int get_size(int u){return sz[find_set(u)];}
};
const int INF = 1e9 + 69;
struct SegmentTree{
int n;
vector<int> a;
SegmentTree(int _n){
n = _n;
a.resize(n * 2 + 2, -INF);
}
void update(int i, int v){
i += n; if (!maximize(a[i], v)) return;
while(i > 1){
i >>= 1;
a[i] = max(a[i * 2], a[i * 2 + 1]);
}
}
int get(int l, int r){
l += n; r += n + 1;
int ans = -INF;
while(l < r){
if (l & 1) maximize(ans, a[l++]);
if (r & 1) maximize(ans, a[--r]);
l >>= 1; r >>= 1;
}
return ans;
}
};
void solve(){
int n, m, q; cin >> n >> m >> q;
vector<array<int, 3>> edges(m);
for(int i = 0; i < m; ++i) cin >> edges[i][1] >> edges[i][2] >> edges[i][0];
sort(ALL(edges));
DSU mst(n);
for(auto i: edges){
mst.join_set(i[1], i[2], i[0]);
}
for(int i = 1; i <= n; ++i) mst.join_set(1, i, INF);
vector<pair<int,int>> chain = mst.chain[mst.find_set(1)];
SegmentTree st(n-1);
vector<int> pos(n+1);
for(int i = 0; i < n; ++i){
pos[chain[i].second] = i;
if (i > 0) st.update(i, chain[i].first);
}
while(q--){
int u, v, w; cin >> u >> v >> w;
u = pos[u], v = pos[v];
if (u > v) swap(u, v);
if (st.get(u+1, v) <= w) cout << "TAIP\n";
else cout << "NE\n";
}
}
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << "ms!\n";
return 0;
}
