RT

已经试过讨论区内的所有方法，均无效。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<map>
#include<unordered_map>
#include<vector>
#include<queue>
#include<bitset>
#include<set>
#include<ctime>
#include<random>
#define x1 xx1
#define y1 yy1
#define IOS ios::sync_with_stdio(false)
#define ITIE cin.tie(0);
#define OTIE cout.tie(0);
#define PY puts("Yes")
#define PN puts("No")
#define PW puts("-1")
#define P__ puts("")
#define PU puts("--------------------")
#define popc __builtin_popcount
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define gc getchar
#define pc putchar
#define pb emplace_back
#define rep(a,b,c) for(int a=(b);a<=(c);a++)
#define per(a,b,c) for(int a=(b);a>=(c);a--)
#define reprange(a,b,c,d) for(int a=(b);a<=(c);a+=d)
#define perrange(a,b,c,d) for(int a=(b);a>=(c);a-=d)
#define graph(i,j,k,l) for(int i=k[j];i;i=l[i].nxt)
#define lowbit(x) (x&-x)
#define lson(x) (x<<1)
#define rson(x) (x<<1|1)
#define mem(x,y) memset(x,y,sizeof x)
//#define double long double
//#define int long long
//#define int __int128
using namespace std;
bool greating(int x,int y){return x>y;}
bool greatingll(long long x,long long y){return x>y;}
bool smallingll(long long x,long long y){return x<y;}
namespace Fread {
	const int SIZE=1<<21;
	char buf[SIZE],*S,*T;
	inline char getc(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return '\n';}return *S++;}
}
namespace Fwrite{
	const int SIZE=1<<21;
	char buf[SIZE],*S=buf,*T=buf+SIZE;
	inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}
	inline void putc(char c){*S++=c;if(S==T)flush();}
	struct NTR{~NTR(){flush();}}ztr;
}
/*#ifdef ONLINE_JUDGE
#define getchar Fread::getc
#define putchar Fwrite::putc
#endif*/
inline int rd(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}return x*f;
}
inline void write(int x,char ch='\0'){
	if(x<0){x=-x;putchar('-');}
	int y=0;char z[40];
	while(x||!y){z[y++]=x%10+48;x/=10;}
	while(y--)putchar(z[y]);if(ch!='\0')putchar(ch);
}
bool Mbg;
const int maxn=8e4+5,maxm=4e5+5,inf=0x3f3f3f3f;
const long long llinf=0x3f3f3f3f3f3f3f3f;
int n,m,Q,a[maxn],b[maxn];
namespace tree{
	vector<int>G[maxn];
//	vector<int>v[maxn];
	int dep[maxn],lg[maxn],f[maxn][20],fa[maxn],siz[maxn];
	bool vis[maxn];
	void dfs(int x,int y){
		dep[x]=dep[y]+1,f[x][0]=y;
		rep(i,1,18)f[x][i]=f[f[x][i-1]][i-1];
		for(int u:G[x])if(u^y)dfs(u,x);
	}
	void d_f_s(int x,int y,int rt){
		vis[x]=1,fa[x]=rt,siz[rt]++;
		for(int u:G[x])if(u^y)d_f_s(u,x,rt);
	}
	int LCA(int x,int y){
		if(dep[x]<dep[y])swap(x,y);
		while(dep[x]^dep[y])x=f[x][lg[dep[x]-dep[y]]-1];
		if(x==y)return x;
		per(i,18,0)if(f[x][i]^f[y][i])x=f[x][i],y=f[y][i];
		return f[x][0];
	}
}using namespace tree;
namespace segtree{
	struct node{
		int ls,rs,val;
	}d[maxn<<7];
	queue<int>q;
	int rt[maxn];
	vector<int>pt[maxn];
	void bd(int x,int l,int r,int &p,int root){
		p=q.front();q.pop();pt[root].pb(p);
		if(l==r){if(l==x)d[p].val++;return;}
		int mid=l+r>>1;bd(x,l,mid,d[p].ls,root),bd(x,mid+1,r,d[p].rs,root);
		d[p].val=d[d[p].ls].val+d[d[p].rs].val;
	}
	void ins(int x,int l,int r,int &p,int tp,int root){
		p=q.front();q.pop();pt[root].pb(p);
		d[p]=d[tp],d[p].val++;
		if(l==r)return;
		int mid=l+r>>1;
		if(x<=mid)ins(x,l,mid,d[p].ls,d[tp].ls,root);
		else ins(x,mid+1,r,d[p].rs,d[tp].rs,root);
	}
	void _dfs_(int x,int y,int root){
		if(y)ins(a[x],1,m,rt[x],rt[y],root);
		for(int u:G[x])if(u^y)_dfs_(u,x,root);
	}
	void kill(int p){
		d[p].ls=d[p].rs=d[p].val=0;
	}
	int qry(int l,int r,int k,int lp,int rp,int tp,int fp){
		if(l==r)return b[l];
		int res=d[d[lp].ls].val+d[d[rp].ls].val-d[d[tp].ls].val-d[d[fp].ls].val,mid=l+r>>1;
		if(k<=res)return qry(l,mid,k,d[lp].ls,d[rp].ls,d[tp].ls,d[fp].ls);
		else return qry(mid+1,r,k-res,d[lp].rs,d[rp].rs,d[tp].rs,d[fp].rs);
	}
}using namespace segtree;
void merge(int x,int y){//fx<-fy
	int fx=fa[x],fy=fa[y];
	if(siz[fx]<siz[fy])swap(fx,fy),swap(x,y);
	for(int i:pt[fy])kill(i),q.push(i);pt[fy].clear();
	G[x].pb(y),G[y].pb(x);d_f_s(y,x,fx),dfs(y,x),_dfs_(y,x,fx);
}
void solve_the_problem(){
	cin>>n>>m>>Q;
	rep(i,1,n)cin>>a[i];
	rep(i,1,maxn<<7)q.push(i);
	rep(i,1,m){
		int x,y;cin>>x>>y;
		G[x].pb(y),G[y].pb(x);
	}
	rep(i,1,n){lg[i]=lg[i-1];if((1<<lg[i])==i)lg[i]++;}
	rep(i,1,n)b[i]=a[i];
	sort(b+1,b+n+1);m=unique(b+1,b+n+1)-(b+1);
	rep(i,1,n)a[i]=lower_bound(b+1,b+m+1,a[i])-b;
	rep(i,1,n)if(!vis[i]){
		dfs(i,0),d_f_s(i,0,i);
		bd(a[i],1,m,rt[i],i);
		_dfs_(i,0,i);
	}
	int lstans=0;
	while(Q--){
		char op;int x,y,k;cin>>op>>x>>y;
		x^=lstans,y^=lstans;
		if(op=='Q'){
			cin>>k;k^=lstans;
			int lca=LCA(x,y);
			write(lstans=qry(1,m,k,rt[x],rt[y],rt[lca],rt[f[lca][0]]),10);
		}else{
			merge(x,y);
		}
	}
}
bool Med;
signed main(){
//	freopen("1.in","r",stdin);freopen("1.ans","w",stdout);
//	fprintf(stderr,"%.3lfMB\n",(&Mbg-&Med)/1048576.0);
	IOS;int _=1,ID;cin>>ID;while(_--)solve_the_problem();
}
/*

*/