#include<bits/stdc++.h>

using namespace std;

#define il inline

#define rg register

#define gc getchar()

#define rp(i,x,y) for(rg int i=x;i<=y;++i)

const int N=+;

int n,m,q,st[N],tot,nod_cnt,rt[N],r,l,fa[N],num[N];

struct sgtr{int l,r,ls,rs,sz,name;}tr[N<<];

il int fd(int x){return fa[x]==x?x:fa[x]=fd(fa[x]);}

il int read()

{

    rg char ch=gc;rg int x=;rg bool y=;

    while(ch!='-' && (ch>'' || ch<''))ch=gc;

    if(ch=='-')ch=gc,y=;

    while(ch>='' && ch<='')x=(x<<)+(x<<)+(ch^''),ch=gc;

    return y?x:-x;

}

il char rdch(){rg char ch=gc;while(ch!='Q' && ch!='B')ch=gc;return ch;}

il int modify(int l,int r,int dat)

{

    int nw=++nod_cnt;tr[nw].l=l;tr[nw].r=r;tr[nw].sz++;if(l==r)return nw;int mid=(l+r)>>;

    if(dat<=mid)tr[nw].ls=modify(l,mid,dat);

    else tr[nw].rs=modify(mid+,r,dat);

    return nw;

}

il int merge(int nw1,int nw2)

{

    if(!nw1 || !nw2)return nw1+nw2;

    if(tr[nw1].l==tr[nw1].r)return tr[nw1].sz+=tr[nw2].sz,nw1;

    tr[nw1].sz+=tr[nw2].sz;tr[nw1].ls=merge(tr[nw1].ls,tr[nw2].ls);tr[nw1].rs=merge(tr[nw1].rs,tr[nw2].rs);

    return nw1;

}

il int query(int nw,int dat)

{

    if(tr[nw].sz<dat)return -;

    if(tr[nw].l==tr[nw].r)return num[tr[nw].l];

    if(tr[tr[nw].ls].sz>=dat)return query(tr[nw].ls,dat);

    return query(tr[nw].rs,dat-tr[tr[nw].ls].sz);

}

int main()

{

//      freopen("ywx.in","r",stdin);freopen("ywx.out","w",stdout);

    n=read();m=read();rp(i,,n){fa[i]=i;int x;num[x=read()]=i,rt[i]=modify(,n,x);}

    rp(i,,m){int x=read(),y=read();x=fd(x);y=fd(y);if(x!=y)rt[x]=merge(rt[x],rt[y]),fa[y]=x;}

    q=read();

    rp(i,,q){char op=rdch();int x=read(),y=read();if(op=='B'){x=fd(x);y=fd(y);if(x!=y)merge(rt[x],rt[y]),fa[y]=x;}else{printf("%d\n",query(rt[fd(x)],y));}}

    return ;

}