#include<cstdio>

 #include<ext/pb_ds/assoc_container.hpp>

 #include<ext/pb_ds/tree_policy.hpp>

 using namespace std;

 using namespace __gnu_cxx;

 using namespace __gnu_pbds;

 tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> T[];

 tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>::iterator it;

 int num[],val[],fa[],rank[];

 int n,m,q,x,y,f1,f2;

 char op[];

 int Res,Num;char C,CH[];

 inline int G()

 {

     Res=;C='*';

     while(C<''||C>'')C=getchar();

     while(C>=''&&C<=''){Res=Res*+(C-'');C=getchar();}

     return Res;

 }

 inline void P(int x)

 {

     Num=;while(x>)CH[++Num]=x%,x/=;

     while(Num)putchar(CH[Num--]+);

     putchar('\n');

 }

 void init()

 {

     for(int i=;i<=n;i++)

       fa[i]=i;

 }

 int findroot(int x)

 {

     if(fa[x]==x)

       return x;

     int rt=findroot(fa[x]);

     fa[x]=rt;

     return rt;

 }

 void Union(const int &u,const int &v)

 {

     if(rank[u]<rank[v])

       {

           fa[u]=v;

           for(it=T[u].begin();it!=T[u].end();it++)

             T[v].insert((*it));

           T[u].clear();

       }

     else

       {

         fa[v]=u;

         for(it=T[v].begin();it!=T[v].end();it++)

             T[u].insert((*it));

           T[v].clear();

         if(rank[u]==rank[v]) rank[u]++;

       }

 }

 int main()

 {

     n=G();m=G();

     init();

     for(int i=;i<=n;i++)

       {

           val[i]=G();

           T[i].insert(val[i]);

           num[val[i]]=i;

       }

     for(int i=;i<=m;i++)

       {

           x=G();y=G();

           f1=findroot(x),f2=findroot(y);

           if(f1!=f2) Union(f1,f2);

       }

     q=G();

     for(int i=;i<=q;i++)

       {

           scanf("%s",op);x=G();y=G();

           if(op[]=='Q')

             {

                 f1=findroot(x);

                 if(T[f1].size()<y) puts("-1");

                 else P(num[*T[f1].find_by_order(y-)]);

             }

           else

             {

                 f1=findroot(x),f2=findroot(y);

               if(f1!=f2) Union(f1,f2);

             }

       }

     return ;

 }