//
// Created by hy on 2019/7/20.
//
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <queue>
#include <map>
#include<memory.h>
using namespace std;
const int maxn=105;
#define MAX 0x3f3f3f3f
int n,m;
double road[maxn][maxn];
double d[maxn];
int book[maxn];
int rnt[maxn];
bool spfa(int s)
{
    memset(book,0,sizeof(book));
    memset(d,MAX,sizeof(d));
    memset(rnt,0,sizeof(rnt));
    queue<int>qu;
    qu.push(s);
    book[s]=1;
    d[s]=1;
    rnt[s]++;
    while(!qu.empty())
    {
        int now=qu.front();
        qu.pop();
        book[now]=0;
        for(int i=1;i<=n;i++)
        {
            if(d[i]<d[now]*road[now][i])
            {
                d[i]=d[now]*road[now][i];
                if(!book[i])
                {
                    qu.push(i);
                    book[i]=1;
                    rnt[i]++;
                    if(rnt[i]>n-1)
                        return true;
                }
            }
        }
    }
    return false;
}
int main() {


    int res=0;
    while (~scanf("%d", &n)) {
        if(n==0)
            break;
        string str;
        map<string, int> mp;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=i;j++)
            {
                if(i==j)
                    road[i][j]=0;
                else
                    road[i][j]=MAX;
            }
        }
        for (int i = 1; i <= n; i++) {
            cin >> str;
            mp[str] = i;

        }
        string str1, str2;
        double num;
        scanf("%d",&m);
        for (int i = 1; i <= m; i++) {
            cin >> str1 >> num >> str2;
            road[mp[str1]][mp[str2]] = num;
        }
        res++;
        if (spfa(1))
            printf("Case %d: Yes\n",res);
        else
            printf("Case %d: No\n",res);

    }
    return 0;
}