/**

      稳定婚姻：男生不停的求婚，女生不停地拒绝

 **/

 #include <iostream>

 #include <queue>

 #include <cstdio>

 #include <cstring>

 using namespace std;

 #define maxn 40

 int pref[maxn][maxn],order[maxn][maxn],next[maxn];

 int future_wife[maxn],future_huaband[maxn];

 int man[maxn];

 queue<int > q;

 char str[];

 void engage(int man,int woman){

     int m = future_huaband[woman];

     if(m){

         future_wife[m] =;

         q.push(m);

     }

     future_huaband[woman] = man;

     future_wife[man] = woman;

 }

 int main()

 {

     int t;

     scanf("%d",&t);

     while(t--){

         memset(man,,sizeof(man));

         int n;

         scanf("%d",&n);

         char  c;

         for(int i=;i<n;i++){//男

             cin>>c;

             man[c-'a'+] =;

         }

         for(int i=;i<n;i++)//女

             cin>>c;

         for(int i=;i<=n;i++){//男喜欢

             cin>>str;

         //cout<<str<<endl;

             int temp = str[]-'a'+;//哪个男生

             //cout<<temp<<endl;

             for(int j=;str[j];j++){

                 pref[temp][j-] = str[j]-'A'+;

                 //cout<<pref[temp][j]<<endl;

             }

             next[temp] = ;

             future_wife[temp] =;

             q.push(temp);

         }

         for(int i=;i<=n;i++){

             cin>>str;

             //cout<<str<<endl;

             int temp = str[]-'A'+;

             for(int j=;str[j];j++){

                 order[temp][str[j]-'a'+] = j-;

             }

             future_huaband[temp] =;

         }

         while(!q.empty()){

             int man = q.front();

             q.pop();

             int woman = pref[man][next[man]++];

             if(!future_huaband[woman]){

                 engage(man,woman);

             }else if(order[woman][man]<order[woman][future_huaband[woman]]){

                 engage(man,woman);

             }else

                 q.push(man);

         }

         while(!q.empty()) q.pop();

         for(int i=;i<maxn;i++)if(man[i]){

             printf("%c %c\n",(char)(i-+'a'),(char)(future_wife[i]-+'A'));

         }

         if(t)

             printf("\n");

     }

     return ;

 }