#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void testCase() {
    int n;
    cin >> n;

    string s;
    int l, m = 0;
    vector<pair<string, int>> v[n];
    for (int i = 0; i < n; i++) {
        cin >> l;

        m += l;

        for (int j = 0; j < l; j++) {
            cin >> s;

            auto it = s.find('=');

            v[i].emplace_back(s.substr(0, it), stoi(s.substr(it + 1)));
        }
    }

    int q;
    cin >> q;

    int x;
    map<string, int> mp;
    while (q--)
        cin >> s >> x, mp[s] = x;

    vector<int> sol;
    for (int i = 0; i < m; i++) {
        bool found = 0;
        for (int j = 0; j < n; j++) {
            if (v[j].empty())
                continue;

            if (mp.find(v[j].back().first) == mp.end() || mp[v[j].back().first] == v[j].back().second) {
                mp.erase(v[j].back().first), sol.push_back(j), v[j].pop_back(), found = 1;

                break;
            }
        }

        if (!found)
            return cout << "NO", void();
    }

    cout << "YES" << el;

    reverse(sol.begin(), sol.end());

    for (auto &i: sol)
        cout << i + 1 << ' ';
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}