#include<bits/stdc++.h>
using namespace std;
char c;
long long n,m,v[1005],p,pp,x,y,t;
vector<long long>vv[100005],vp;
priority_queue<long long,vector<long long>,greater<long long> >q[100005]; 
int main(){
    freopen("bzoj_2733.in","r",stdin);
    freopen("bzoj_2733.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        cin>>p;
        v[p]=i;
    }
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        vv[x].push_back(y);
        vv[y].push_back(x);
        q[x].push(v[y]);
        q[y].push(v[x]);
    }
    cin>>pp;
    while(pp--){
        cin>>c>>x>>y;
        if(c=='B'){
            vv[x].push_back(y);
            vv[y].push_back(x);
            q[x].push(v[y]);
            q[y].push(v[x]);
        }else{
            t=0;
            while(!q[x].empty()){
                p=q[x].top();
                q[x].pop();
                t++;
                vp.push_back(p);
                if(t==y){
                    cout<<p<<endl;
                    for(int i=0;i<vp.size();i++){
                        q[x].push(vp[i]);
                    }
                    break;
                }
                if(t<y){
                    cout<<-1<<endl;
                }
            }
            
        }
    } 
    return 0;
}