#include <bits/stdc++.h>
using namespace std;

// #define int long long
#define endl '\n'
typedef unsigned long long ull;

const int N = 1e5;
const int INF = 0x3f3f3f3f3f3f3f3f;

void solve()
{
    int n;
    scanf("%d", &n);
    // cout << n << endl;
    char x;
    scanf("%c", &x);
    // cin >> n;
    vector<vector<array<int, 3>>> v(n + 1, vector<array<int, 3>>(3));
    for (int i = 1; i < n; ++i)
    {
        for (int j = 0; j < 3; ++j)
        {
            scanf("(%d, %d, %d)", &v[i][j][0], &v[i][j][1], &v[i][j][2]);
            char x;
            scanf("%c", &x);
            //  cout << v[i][j][0] << " " << v[i][j][2] << endl;
            // cout << ","<< x <<"," <<endl;
        }
        // char x;
        // scanf("%c",&x);
    }
    int m;
    scanf("%d", &m);
    // cout << m << endl;
    while (m--)
    {
        int x;
        scanf("%d", &x);
        unordered_map<int, int> t;
        for (int i = 1; i <= x; ++i)
        {
            int tmp;
            scanf("%d", &tmp);
            t[i] = tmp;
            // cout << t[i] << " ";
        }
        // cout << endl;

        char tmp;
        scanf("%c", &tmp);
        if (n == 1)
        {
            cout << "yes\n";
            continue;
        }
        int now = 1;
        int st = 1;
        int ok = 0;
        for (int c = 1; c <= 10; ++c)
        {
            int input;
            if (t.find(now) != t.end())
                input = t[now];
            else
                input = t[now] = 2;
            //  cout << "st " <<st << " input" << input << "now " << now << endl;
            t[now] = v[st][input][2];
            now += v[st][input][1];
            st = v[st][input][0];

            if (st == n)
            {
                cout << "yes\n";
                ok = 1;
                break;
            }
        }
        if (!ok)
        {
            cout << "no\n";
        }
    }
}

signed main()
{
    // cout.flags(ios::fixed); cout.precision(8);
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);

    int T = 1;
    scanf("%d", &T);
    // cin >> T;
    for (int i = 1; i <= T; ++i)
    {
        cout << "Machine #" << i << ":\n";
        solve();
    }
    return 0;
}
/*

*/