#include <bits/stdc++.h>
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define SP << " " <<
#define fish signed
using namespace std;
mt19937 rnd(1209);
const int INF = 0x3f3f3f3f3f3f3f3f;
const int N = 1e2 + 10;
map<string, int> mp;
int idx = 0;
int get(string s)
{
    if(mp.count(s)) return mp[s];
    return mp[s] = ++ idx;
}
vector<pair<int, int>> v[N];
const int M = 1e4 + 10;
int opt[M];
fish main()
{
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n; cin >> n;
    int cnt = 0;
    for(int i = 1; i <= n; i ++)
    {
        int x; cin >> x; cnt += x;
        for(int j = 1; j <= x; j ++)
        {
            string s; cin >> s;
            int val = 0, now;
            for(int k = 0; s[k]; k ++) if(s[k] == '=') {now = k; break;}
            for(int k = now + 1; s[k]; k ++) val = val * 10 + (s[k] - '0');
            s = s.substr(0, now);
            // cerr << s SP val << "\n";
            v[i].push_back({get(s), val});
        }
    }
    int m; cin >> m;
    for(int i = 1; i <= m; i ++)
    {
        string s; int val;
        cin >> s >> val;
        opt[get(s)] = val;
    }
    vector<int> ans;
    while(1)
    {
        bool f = 0;
        for(int j = 1; j <= n; j ++)
        {
            if(!v[j].size()) continue;
            auto x = *v[j].rbegin();
            if(x.second == opt[x.first] || opt[x.first] == -1)
                ans.push_back(j), v[j].pop_back(), opt[x.first] = -1, f = 1;
        }
        if(!f) break;
    }
    // for(int i = 1; i <= m; i ++, cerr << "--------------------\n")
    //     for(auto x : v[i]) cerr << x.first SP x.second << "\n";
    if(ans.size() != cnt) return cout << "No", 0;
    reverse(ans.begin(), ans.end()); cout << "Yes\n";
    for(auto v : ans) cout << v << " ";
    return 0;
}