#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <iostream>
#include <string>
#include <map>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
const int MAXN = 30 + 5;
const int INF = 0x3f3f3f3f;
 
typedef pair<int, int> pii;
priority_queue<pii, vector<pii>, greater<pii> >qu;
double mp[MAXN][MAXN];
map<string, int> dic;
int n, d[MAXN], k, cases = 0;
 
void Floyd()
{
    for (int k = 0; k < n; k++)
        for (int i = 0; i < n; i++)
        {
            if (mp[i][i] > 1)
            {
                printf("Case %d: Yes\n", ++cases);
                return;
            }
            if (mp[i][k] != 0)
                for (int j = 0; j < n; j++)
                    mp[i][j] = max(mp[i][j], mp[i][k] * mp[k][j]);
        }
    printf("Case %d: No\n", ++cases);
}
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int nr, i, j;
    char str[100], sstr[100];
    double er;
    while (scanf("%d", &n), n)
    {
        dic.clear();
        for (i = 0; i < n; i++)
            for (j = 0; j < n; j++)
                mp[i][j] = (i == j ? 1 : 0);
        int k = 0;
        for (i = 0; i < n; i++)
        {
            scanf("%s", str);
            dic[str] = k++;
        }
        scanf("%d", &nr);
        for (i = 0; i < nr; i++)
        {
            scanf("%s%lf%s", str, &er, sstr);
            mp[dic[str]][dic[sstr]] = er;
        }
        Floyd();
    }
    return 0;
}