/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 5e5 + 5, LG = 18, MOD = 1e9 + 7;
const long double PI = acos(-1);
const long double EPS = 1e-7;
int tr[N][26];
int sz[N], ptr;

void add(string s) {
    int cur = 0;
    for (char c: s) {
        if (!tr[cur][c - 'a']) {
            tr[cur][c - 'a'] = ++ptr;
        }
        cur = tr[cur][c - 'a'];
    }
    sz[cur] += 1;
}

ii dfs(int node, int limit) {
    vector<int> vec;
    int ans = 0;
    int cur = sz[node];
    f(i, 0, 26)
        if (tr[node][i]) {
            auto p = dfs(tr[node][i], limit);
            ans += p.F;
            vec.push_back(p.S);
            cur += p.S;
        }
    sort(rall(vec));
    for (auto x: vec) {
        if (cur <= limit)break;
        cur -= x;
        ans += 1;
    }
    return {ans, cur};
}

void doWork() {
    int n;
    cin >> n;
    vector<vector<pair<string, string>>> vec;
    int tot = 0;
    f(i, 0, n) {
        int s;
        cin >> s;
        tot += s;
        vec.push_back(vector<pair<string, string>>());
        f(j, 0, s) {
            string st;
            cin >> st;
            int pos = st.find('=');
            string a = st.substr(0, pos);
            string b = st.substr(pos + 1);
            vec.back().push_back({a, b});
        }
    }

    vector<int> ans;
    map<string, string> mp;
    int k;
    cin >> k;
    f(i, 0, k) {
        string s1, s2;
        cin >> s1 >> s2;
        mp[s1] = s2;
    }
    f(i, 0, tot) {
        bool ok = false;
        f(j, 0, n) if (vec[j].size()) {
                if (!mp.count(vec[j].back().F)) {
                    vec[j].pop_back();
                    ans.push_back(j + 1);
                    ok = true;
                    break;
                } else if (mp[vec[j].back().F] == vec[j].back().S) {
                    mp.erase(vec[j].back().F);
                    vec[j].pop_back();
                    ans.push_back(j + 1);
                    ok = true;
                    break;
                }
            }
        if (!ok) {
            cout << "No\n";
            return;
        }
    }
    reverse(all(ans));
    cout << "Yes\n";
    for (auto x: ans)cout << x << ' ';

}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}