#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct solider{
	int a;
	bool k;
}s[1000010];
int rc[1000010],lc[1000010],f[1000010],dist[1000010];
int find(int x){
	if(f[x]!=x)
		f[x]=find(f[x]);
	return f[x];
}
int merge(int x,int y){
	if(!x||!y)
		return x+y;
	if(s[x].a>s[y].a)
		swap(x,y);
	rc[x]=merge(rc[x],y);
	if(dist[rc[x]]>dist[lc[x]])
		swap(rc[x],lc[x]);
	dist[x]=dist[rc[x]]+1;
	f[rc[x]]=f[lc[x]]=x;
	return x;
}
int n,m,a,b;
char op;
int main (){
	dist[0]=-1;
	scanf("%d",&n);
	for(register int i=1;i<=n;i++){
		scanf("%d",&s[i].a);
		f[i]=i;
	}
	scanf("%d",&m);
	while(m--){
		cin>>op;
		if(op=='M'){
			scanf("%d%d",&a,&b);
			a=find(a);
			b=find(b);
			if(a==b||s[a].k||s[b].k) continue;
			else
				merge(a,b);
		}
		else{
			scanf("%d",&a);
			if(s[a].k){
				printf("0\n");
				continue;
			}
			else{
				a=find(a);
				s[a].k=1;
				printf("%d\n",s[a].a);
				f[rc[a]]=f[lc[a]]=merge(lc[a],rc[a]);
			}
		}
	}
	return 0;
}