#include <bits/stdc++.h>
using namespace std;
int F[520];
int findfa(int x){ // 找父亲
if(x == F[x])return F[x];
return F[x] = findfa(F[x]);
}
void sum(int x,int y){ // 合并两个集合
int s = findfa(x);
int t = findfa(y);
if(s != t)F[s] = t;
}
int main(){
int n,m,k;
cin >> n >> m >>k;
for(int i = 1; i <= n; i++)
F[i] = i;
int a[520][520];
while(m--){
int x,y,t;
cin >> x >> y >> t;
a[y][x] = a[x][y] = t;
if(t == 1)
sum(x,y);
}
int man,man1;
while(k--){
cin >> man >> man1;
if(a[man][man1] == 1)printf("No problem\n");
if(F[findfa(man)] == F[findfa(man1)] && a[man][man1] == -1)
printf("OK but...\n");
if(F[findfa(man)] != F[findfa(man1)] && a[man][man1] == -1)
printf("No way\n");
if(a[man][man1] == 0) printf("OK\n");
}
return 0;
}