#include <iostream>

 #include <cstdio>

 #include <map>

 #include <queue>

 #include <cstring>

 using namespace std;

 int n,a;

 double Map[][];

 const int INF=;

 map<string,int>V;

 int spfa()

 {

     queue<int>q;

     double node[]= {};

     int inq[]= {};

     node[]=;

     inq[]=;

     q.push();

     while (!q.empty())

     {

         int s=q.front();

         q.pop();

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

         {

             //cout<<Map[s][i]<<" "<<node[i]<<endl;

             if (node[i]<Map[s][i]*node[s])

             {

                 //cout<<node[i]<<" "<<Map[s][i]<<endl;

                 node[i]=Map[s][i]*node[s];

                 if (!inq[i])

                 {

                     q.push(i);

                     inq[i]=;

                 }

                 if (node[]>)

                     return ;

             }

         }

         inq[s]=;

     }

     return ;

 }

 int main ()

 {

     char ch[];

     int cmp=,q;

     while (scanf("%d",&n),n)

     {

         q=;

         V.clear();

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

             for (int j=; j<=n; j++)

                 Map[i][j]=;

         //memset(Map,INF,sizeof(Map));

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

         {

             scanf("%s",ch);

             if (!V[ch])

                 V[ch]=++q;

         }

         scanf("%d",&a);

         for (int i=; i<=a; i++)

         {

             double money;

             char ch1[],ch2[];

             scanf("%s%lf%s",ch1,&money,ch2);

             if (Map[V[ch1]][V[ch2]]<money)

                 Map[V[ch1]][V[ch2]]=money;

             //cout<<Map[V[ch1]][V[ch2]]<<endl;

         }

         printf ("Case %d: ",cmp++);

         if (spfa())

             printf("Yes\n");

         else

             printf ("No\n");

     }

     return ;

 }