#include <bits/stdc++.h>
using namespace std;
typedef int ll;
inline ll read()
{ll s=0;bool f=0;char ch=' ';while(!isdigit(ch)){f|=(ch=='-'); ch=getchar();}while(isdigit(ch)){s=(s<<3)+(s<<1)+(ch^48); ch=getchar();}return (f)?(-s):(s);
}
#define R(x) x=read()
inline void write(ll x)
{if(x<0){putchar('-'); x=-x;}if(x<10){putchar(x+'0'); return;}write(x/10);putchar((x%10)+'0');return;
}
#define W(x) write(x),putchar(' ')
#define Wl(x) write(x),putchar('\n')
const int N=100005;
int n,m,Q,island[N],rnk[N],fa[N],sz[N];
inline int gf(int x){return (fa[x]==x)?(x):(fa[x]=gf(fa[x]));}
int rt[N],cnt=0;
struct Node
{int ls,rs,sum;
}T[N*50];
inline void Insert(int &x,int l,int r,int Pos)
{if(!x) x=++cnt;T[x].sum++;if(l==r) return;int mid=(l+r)>>1;if(Pos<=mid) Insert(T[x].ls,l,mid,Pos);else Insert(T[x].rs,mid+1,r,Pos);T[x].sum=T[T[x].ls].sum+T[T[x].rs].sum;
}
inline int Merg(int x,int y,int l,int r)
{if(!x) return y;if(!y) return x;int mid=(l+r)>>1;T[x].ls=Merg(T[x].ls,T[y].ls,l,mid);T[x].rs=Merg(T[x].rs,T[y].rs,mid+1,r);T[x].sum=T[T[x].ls].sum+T[T[x].rs].sum;return x;
}
inline void combine(int x,int y)
{int fx=gf(x),fy=gf(y);sz[fx]+=sz[fy];  fa[fy]=fx;rt[fx]=Merg(rt[fx],rt[fy],1,n);
}
inline int Ask(int x,int l,int r,int Id)
{if(l==r) return l;int mid=(l+r)>>1;if(T[T[x].ls].sum>=Id) return Ask(T[x].ls,l,mid,Id);else return Ask(T[x].rs,mid+1,r,Id-T[T[x].ls].sum);
}
int main()
{int i,x,y; char opt[5];R(n); R(m);for(i=1;i<=n;i++){sz[i]=1; fa[i]=i; island[rnk[i]=read()]=i;Insert(rt[i],1,n,rnk[i]);}
//    cout<<"@@@@@@@@@@@@@@@@@@@@"<<endl;for(i=1;i<=m;i++) combine(read(),read());R(Q);while(Q--){scanf("%s",opt+1); R(x); R(y);if(opt[1]=='B') combine(x,y);else{int fx=gf(x);if(sz[fx]<y) puts("-1"); else Wl(island[Ask(rt[fx],1,n,y)]);}}return 0;
}
/*
Sample Input
5 1
4 3 2 5 1
1 2
7
Q 3 2
Q 2 1
B 2 3
B 1 5
Q 2 1
Q 2 4
Q 2 3
Sample Output
-1
2
5
1
2
*/