#include<iostream>

 #include<cstring>

 #include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 #define maxn 1000005

 using namespace std;

 int d[maxn],ls[maxn],rs[maxn],a[maxn],size[maxn],fa[maxn];

 int n,m;

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

 int merger(int x,int y){

     if(!x) return y;

     if(!y) return x;

     if(a[x]>a[y]) swap(x,y);

     rs[x]=merger(rs[x],y);

     if(size[ls[x]]<size[rs[x]]) swap(ls[x],rs[x]);

     size[x]=size[rs[x]]+;

     return x;

 }

 int main() {

     scanf("%d",&n);

     for(int i=;i<=n;i++) scanf("%d",&a[i]);

     scanf("%d",&m);

     for(int i=;i<=n;i++) fa[i]=i;

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

         char ch[];

         scanf("%s",ch);

         if(ch[]=='M') {

             int x,y;

             scanf("%d%d",&x,&y);

             if(d[x]||d[y]) continue;

             int f1=find(x),f2=find(y);

             if(f1!=f2) {fa[f1]=fa[f2]=merger(f1,f2);}

         }

         else {

             int x;

             scanf("%d",&x);

             if(d[x]) printf("0\n");

             else {

                 int f=find(x);d[f]=;

                 printf("%d\n",a[f]);

                 fa[f]=merger(ls[f],rs[f]);

                 fa[fa[f]]=fa[f];

             }

         }

     }

 }