#include <iostream>

#include <cstring>

#include <string>

#include <queue>

#include <map>

#include <algorithm>

using namespace std;

map<string, int> mapp;

double val[][];

int n, m;

bool spfa(int s)

{

    double dis[];

    bool vis[];

    int time[];

    memset(dis, , sizeof dis);

    memset(vis, , sizeof vis);

    memset(time, , sizeof time);

    queue<int> q;

    dis[s] = 1.0;

    vis[s] = true;

    q.push(s);

    while(!q.empty()){

        int u = q.front();

        q.pop();

        vis[u] = false;

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

            if(dis[i] < dis[u] * val[u][i]){

                dis[i] = dis[u] * val[u][i];

                if(!vis[i]){

                    vis[i] = true;

                    q.push(i);

                    if(++time[i] >= n) return true;

                }

            }

        }

    }

    return false;

}

int main()

{

    int kase = ;

    while(){

        cin >> n;

        if(n == ) break;

        memset(val, , sizeof val);

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

            string str;

            cin >> str;

            mapp[str] = i;

        }

        cin >> m;

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

            string str1, str2;

            double value;

            cin >> str1 >> value >> str2;

            val[mapp[str1]][mapp[str2]] = value;

        }

        if(spfa()) cout << "Case " << ++kase << ": Yes" << endl;

        else cout << "Case " << ++kase << ": No" << endl;

    }

    return ;

}