I

//SPFA
#include <iostream>
#include <algorithm>
#include <string>
#include <map>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;

const int maxn = 50;
const double Start = 100;

struct node{
    int val;
    double len;
    node(int _val, double _len){
        val = _val;
        len = _len;
    };
};

map<string ,int>mp;
vector<node>g[maxn];
double d[maxn];
bool vis[maxn];

#define INF 0xffffff

void init(int n, int x){
    for(int i = 0;i <= n;i++){
        d[i] = -INF;
        vis[i] = true;
    }
    d[x] = Start;
}

queue<int>q;
bool SPFA(int s){
    while(!q.empty())
        q.pop();
    q.push(s);
    vis[s] = false;
    while(!q.empty()){
        int x = q.front();q.pop();
        int xl = g[x].size();
        for(int i = 0 ;i < xl; i++){
            node y = g[x][i];
            /*
            if(vis[y.val] == false){
                continue;
            }
            vis[y.val] = true;
            */
            double k = d[x]*y.len;
            if(k > d[y.val]){
                d[y.val] = k;
                q.push(y.val);
            }
        }
        if(d[s] > Start){
            return true;
        }
    }
    return false;
}

int main(){
    int n;
    int cnt = 0;
    while(cin >> n){
        mp.clear();
        for(int i =0 ;i < maxn;i++){
            g[i].clear();
        }
        cnt++;
        if(n == 0)
            break;
        string s;
        for(int i = 1;i <= n;i++){
            cin >> s;
            mp[s] = i;
        }
        int m;
        cin >> m;
        string s1, s2;
        double d;
        for(int i = 0;i < m;i++){
            cin >> s1 >> d >> s2;
            int u = mp[s1];
            int v = mp[s2];
            g[u].push_back(node(v,d));
        }

        bool ok = false;
        for(int i = 1;i <= n;i++){
            init(n, i);
            if(SPFA(i)){
                ok = true;
                break;
            }
        }
        cout << "Case " << cnt << ": ";
        if(ok){
            cout << "Yes" << endl;
        }
        else{
            cout << "No" << endl;
        }
    }
    return 0;
}