const int N = 105;int n;
int hm[N], hw[N];   //hm[i]为第i个男人的配偶   -1表示自由
int a[N][N], b[N][N], p[N]; //a[i][0～n]表示第i个男人心中的女人排名//b[i][0～n]表示第i个女人心中的男人排名
string man[N], woman[N];//姓名
map<string, int> mp;    //姓名->序号
set<int> st;    //自由男人的集合void read(){mp.clear(); st.clear();memset(hm, -1, sizeof hm);memset(hw, -1, sizeof hw);memset(p, 0, sizeof p);cin>>n;FOR(i, 0, n){ cin>>man[i]; mp[ man[i] ] = i; }FOR(i, 0, n){ cin>>woman[i]; mp[ woman[i] ] = i; }string str, s="";int t;FOR(i, 0, n){cin>>str; s = str[0]; t = mp[s];FOR(j, 2, n+2){ s = str[j]; a[t][j-2] = mp[s]; }}FOR(i, 0, n){cin>>str; s = str[0]; t = mp[s];FOR(j, 2, n+2){ s = str[j]; b[t][j-2] = mp[s]; }}
}void solve(){FOR(i, 0, n) {st.insert(i); }   //开始所有男人都是自由的while( !st.empty() ){   //还有自由男人int m = *st.begin(); st.erase(m);   //任取一个while(1){int w = a[m][ p[m]++ ]; //未拒绝此男人的最优女人int m1= hw[w], t;   //此女人的配偶if(m1==-1){ hw[w]=m; hm[m]=w;  break; } //女人自由FOR(i, 0, n) if(b[w][i]==m1 || b[w][i]==m) {t=b[w][i]; break;}  //t是较优的男人if(t==m){   //m更优  重新组合hw[w]=m; hm[m]=w;  hm[m1]=-1;st.insert(m1); break;}}}
}int main(){#ifndef ONLINE_JUDGEfreopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);#endifint T;cin>>T;while(T--){read();solve();FOR(i, 0, n) cout<<man[i]<<' '<<woman[ hm[i] ]<<endl;cout<<endl;}return 0;
}

const int N = 505;int n;
int hm[N], hw[N];   //hm[i]为第i个男人的配偶   -1表示自由
int a[N][N], b[N][N], p[N]; //a[i][0～n] 男i心中的女人次序//b[i][0～n] 女i心中的男人次序
int c[N][N];    //c[i][j] 女i心中，男j的排名
string man[N], woman[N];//姓名
map<string, int> mp,wp;    //姓名->序号
set<int> st;    //自由男人的集合void read(){mp.clear(); wp.clear(); st.clear();memset(hm, -1, sizeof hm);memset(hw, -1, sizeof hw);memset(p, 0, sizeof p);string str;FOR(i, 0, n){cin>>man[i]; mp[ man[i] ] = i;if(i == 0)FOR(j, 0, n){cin>>woman[j]; wp[ woman[j] ] = j;a[i][j] = j;}elseFOR(j, 0, n){cin>>str;a[i][j] = wp[str];}}FOR(i, 0, n){cin>>str; int t = wp[str];FOR(j, 0, n){cin>>str;int v = mp[str];b[t][j] = v;c[t][v] = j;}}
}void solve(){FOR(i, 0, n) {st.insert(i); }   //开始所有男人都是自由的while( !st.empty() ){int m = *st.begin(); st.erase(m);while(1){int w = a[m][ p[m]++ ]; //未拒绝此男人的最优女人int m1 = hw[w];   //此女人的配偶if( m1 == -1 ){ hw[w]=m; hm[m]=w;  break; } //女人无配偶if(c[w][m] < c[w][m1]){   //女人有配偶但m更优hw[w] = m; hm[m] = w;  hm[m1] = -1;st.insert(m1); break;}}}
}int main(){#ifndef ONLINE_JUDGEfreopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);#endifwhile(cin>>n){read();solve();FOR(i, 0, n) cout<<man[i]<<' '<<woman[ hm[i] ]<<endl;cout<<endl;}return 0;
}