#include<iostream>
#include <bits/stdc++.h>

#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 3e5 + 5, inf = 2e9;

map<string, int> id;

int get_id(string const &s) {
    auto it = id.find(s);
    if (it != id.end()) return it->second;
    int sz = id.size();
    return id[s] = sz;
}

vector<pair<int, int> > adj[N];

int final_value[N];
bool assigned[N];
vector<int> pending[N];

void doWork() {
    int t;
    cin >> t;
    queue<int> q;
    for (int i = 0; i < t; i++) {
        q.push(i);
        int l;
        cin >> l;
        while (l--) {
            string s;
            cin >> s;
            int idx = s.find('=');
            adj[i].push_back({get_id(s.substr(0, idx)), stoi(s.substr(idx + 1))});
        }
    }
    int k;
    cin >> k;
    for (int i = 0; i < k; i++) {
        string s;
        int val;
        cin >> s >> val;
        final_value[get_id(s)] = val;
    }
    vector<int> ans;

    while (!q.empty()) {
        int cur = q.front();
        q.pop();

        while (!adj[cur].empty()) {
            int x = adj[cur].back().first;
            if (assigned[x]) {
                ans.push_back(cur);
                adj[cur].pop_back();
            } else if (adj[cur].back().second == final_value[x]) {
                assigned[x] = true;
                ans.push_back(cur);
                adj[cur].pop_back();
                for (auto i: pending[x]) {
                    q.push(i);
                }
                pending[x].clear();
            } else {
                break;
            }
        }
        if (!adj[cur].empty()) {
            int x = adj[cur].back().first;
            pending[x].push_back(cur);
        }
    }
    for (int i = 0; i < t; i++) {
        if (!adj[i].empty()) {
            cout << "No";
            return;
        }
    }
    cout << "Yes\n";
    reverse(ans.begin(), ans.end());
    for (auto i: ans)cout << i + 1 << " ";
}


int main() {
    IO
    int t = 1;
    //   cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}