#include<bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
void solve(){
int n,m;
cin>>n>>m;
vector<int> a(n+1,0),l(m+10),r(m+10);
map<int,int> mp;
for (int i = 1; i <= n; ++i) {
cin>>a[i];
mp[a[i]] = a[i];
}
for (int k = 1; k <= m; ++k) {
cin>>l[k]>>r[k];
mp[l[k]] = l[k];
mp[r[k]] = r[k];
}
for (int i = m; i >= 1 ; --i) {
mp[l[i]] = mp[r[i]];
}
for (int i = 1; i <= n; ++i) {
a[i] = mp[a[i]];
cout<<a[i]<<" ";
}
cout<<endl;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL),cout.tie(NULL);
int t = 1;
cin>>t;
while(t--){
solve();//1 2 3 4 5
}
return 0 ;
}