#include<iostream>
using namespace std;
int relation[105][105];
int f[105];
int n,m,k;
int find(int x)
{
if (x!=f[x]) f[x]=find(f[x]);
return f[x];
}
int main()
{
cin>>n>>m>>k;
for (int i=1;i<=n;i++) f[i]=i;
while (m--)
{
int a,b,r;
cin>>a>>b>>r;
if (r==1) {
f[find(a)]=find(b);
relation[a][b]=1;
relation[b][a]=1;
}
else {
relation[a][b]=-1;
relation[b][a]=-1;
}
}
while (k--)
{
int a,b;
cin>>a>>b;
if (relation[a][b]==1) {
cout<<"No problem\n";
}
else if (relation[a][b]==0) {
cout<<"OK\n";
}
else if (relation[a][b]==-1&&find(a)==find(b)) {
cout<<"OK but...\n";
}
else cout<<"No way\n";
}
}