#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int vex[maxn][maxn],n,vis[maxn];
bool dfs(int a,int b)
{
int i;
vis[a]=1;
for(i=1;i<=n;i++){
if(vex[a][i]==1&&vis[i]==0){
if(i==b||dfs(i,b) )break;
}
}
return i<n+1;
}
int main()
{
// freopen("1.txt","r",stdin);
int m,k;
scanf("%d %d %d",&n,&m,&k);
int a,b,c;
for(int i=0;i<m;i++){
scanf("%d %d %d",&a,&b,&c);
vex[a][b]=vex[b][a]=c;
}
while(k--){
memset(vis,0,sizeof(vis));
scanf("%d %d",&a,&b);
if(vex[a][b]==1||(vex[a][b]==0&&dfs(a,b))) printf("No problem\n");
else if(vex[a][b]==0&&!dfs(a,b)) printf("OK\n");
else{
if(dfs(a,b)) printf("OK but...\n");
else printf("No way\n");
}
}
return 0;
}