#include<iostream>

 #include<math.h>

 using namespace std;

 int a[];

 int map[][];

 int find(int t)

 {

     if(t!=a[t])

     {

         a[t]=find(a[t]);

     }

     return a[t];

 }

 int main()

 {

     int n,m,k,i;

     cin>>n>>m>>k;

     for(i=;i<=n;i++)

         a[i]=i;

     int x,y,z;

     for(i=;i<=m;i++)

     {

         cin>>x>>y>>z;

         map[x][y]=map[y][x]=z;

         if(z==)

         {

             x=find(x);

             y=find(y);

             if(x!=y)

                  a[x]=y;

         }

    }

     int t1,t2;

     for(i=;i<=k;i++)

     {

         cin>>t1>>t2;

         if(map[t1][t2]==)

         {

             cout<<"No problem"<<endl;

         }

         else if(map[t1][t2]==-)

         {

             if(find(t1)==find(t2))

                 cout<<"OK but..."<<endl;

             else

                 cout<<"No way"<<endl;

         }

         else

         {

             cout<<"OK"<<endl;

         }

     }

 }