#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

map<string, int> id;
map<int, string> rid;
int addStr(string a)
{
	if(!id.count(a))
	{
		id[a] = SZ(id);
		rid[id[a]] = a;
	}
	return id[a];
}

const int INF = 1e9;
const int N = 1 << 9;
const int R = 104;



vector<PII> rules[3 * R];

db dpT[N][N][3 * R];

void solve()
{
	int n;
	cin >> n;
	
	FOR(i, 0, n + 1)
		FOR(j, 0, n + 1)
			fill(dpT[i][j], dpT[i][j] + 3 * R, -INF);
	
	FOR(i, 0, n)
	{
		string s;
		while(cin >> s)
		{
			if(s == "END")
				break;
			
			int col = addStr(s);
			db prob;
			cin >> prob;
			prob = log(prob);
			
			dpT[i][i + 1][col] = prob;
		}
	}
	int sz = SZ(id);
	RFOR(l, n, 0)
	{
		FOR(r, l + 2, n + 1)
		{
			FOR(c, 0, sz)
			{
				FOR(m, l + 1, r)
				{
					db sum = 0;
					for(auto rule : rules[c])
						sum = max(sum, dpT[l][m][rule.F] + dpT[m][r][rule.S]);
						
					dpT[l][r][c] = max(dpT[l][r][c], sum);
				}				
			}
		}
	}
	int ans = -1;
	FOR(c, 0, sz)
	{
		if(dpT[0][n][c] == -INF)
			continue;
			
		if(ans == -1 || dpT[0][n][c] > dpT[0][n][ans])
			ans = c;
	}
	if(ans == -1)
		cout << "GAMEOVER\n";
	else
		cout << rid[ans] << "\n";
}


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int r;	
	cin >> r;
	FOR(i, 0, r)
	{
		string a, b, c;
		cin >> a >> b >> c;
		
		int A = addStr(a);
		int B = addStr(b);
		int C = addStr(c);
		
		rules[C].PB({A, B});
		rules[C].PB({B, A});
	}
	
	int q;
	cin >> q;
	while(q--)
	{
		solve();
	}
	
	return 0;
}