#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) (x).begin(),(x).end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popc(x) (__builtin_popcountll((x)))
#define abs(x) ((x)>=0?(x):-(x))
using namespace std;
using ll=long long;
using uint=uint32_t;
namespace asnown {
using i32=int32_t; using u32=uint32_t;
using i64=int64_t; using u64=uint64_t;
using i128=__int128_t; using u128=__uint128_t; };
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
int n,k;
stack<pair<string,int>,vector<pair<string,int>>> st[105];
unordered_map<string,int> ned;
signed main() {
#ifndef ONLINE_JUDGE
#endif
   Solve();
}
void Solve() {
   cin>>n;
   for(int i=1;i<=n;i++) {
      int m; cin>>m;
      while(m--) {
         string s; int x;
         getchar(); getline(cin,s,'=');
         cin>>x;
         st[i].emplace(s,x);
      }
   }
   cin>>k;
   for(int i=1;i<=k;i++) {
      string s; int x; cin>>s>>x;
      assert(!ned.count(s)||ned[s]==x);
      ned[s]=x;
   }
   vector<int> res;
   while(true) {
      bool flag=false;
      for(int i=1;i<=n;i++) if(!st[i].empty())
         if(!ned.count(st[i].top().first)||
          ned[st[i].top().first]==st[i].top().second) {
            if(ned.count(st[i].top().first))
               ned.erase(st[i].top().first);
            flag=true,res.emplace_back(i),st[i].pop();
         }
      bool ept=true;
      for(int i=1;i<=n;i++) ept&=st[i].empty();
      if(ept) break;
      if(!flag) return void(puts("No"));
   }
   puts("Yes");
   reverse(ALL(res));
   for(auto x:res) printf("%d ",x); puts("");
}