#include <bits/stdc++.h>
using namespace std;

string s;
struct node{
	string x,y;
}a[110];

int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].x>>a[i].y;
	}
	cin>>s;
	string s1;
	for(int i=0;i<s.size();i++){
		if(isalpha(s[i])){
			s1+=s[i];
			continue; 
		}else if(!s1.empty()){
			bool flag=false;
			for(int j=1;j<=n;j++){
				if(s1==a[j].x){
					cout<<a[j].y;
					cout<<s[i];
					flag=true;
					break;
				}
			}
			if(!flag){
				cout<<"UNK";
				
			}
			s1="";
			cout<<s[i];
		}
		if(i==s.size()-1){
			bool flag=false;
			for(int j=1;j<=n;j++){
				if(s1==a[j].x){
					cout<<a[j].y;
					flag=true;
					break;
				}
			}
			if(!flag){
				cout<<"UNK";
			}
			s1="";
		}
	}
	return 0;
}

回复请@我，必关，亦求互关~