#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <set>
#include <ctime>
#define NN 300100
#define INF 0x3f3f3f3f;
using namespace std;
multiset <int> H;
int son[NN][3],val[NN],flag[NN],FLAG,root[NN],fa[NN],n,m,st[NN],top;
char ch[10];
void read(int &xx)
{
	bool f=0; char CH;
	for (CH=getchar();CH<'0'||CH>'9';CH=getchar()) if (CH=='-') f=1;
	for (xx=0;CH>='0';CH=getchar()) xx=xx*10+CH-'0'; if (f) xx=-xx;
}
void push_down(int x)
{
	val[x]+=flag[x];
	if (son[x][0]) flag[son[x][0]]+=flag[x];
	if (son[x][1]) flag[son[x][1]]+=flag[x];
	flag[x]=0;
}
int Merge(int x,int y)
{
	push_down(x),push_down(y);
	if (val[x]<val[y]) swap(x,y);
	if ((x&&y)==0) return x;
	int d=rand()&1;
	son[x][d]=Merge(son[x][d],y);
	if (son[x][d]) fa[son[x][d]]=x; return x;
}
int Find(int xx){	return (xx==root[xx]?xx:(root[xx]=Find(root[xx]))); }
void Init(int n)
{
	val[0]=-INF;
	for (int i=1;i<=n;++i)	read(val[i]), H.insert(val[i]), root[i]=i;
}
void U()
{
	int x,y;
	read(x), read(y);
	int fx=Find(x), fy=Find(y);
	if (fx==fy) return;
	root[fx]=root[fy]=Merge(fx,fy);
	if (root[fx]==fx) H.erase(H.find(val[fy])); else H.erase(H.find(val[fx]));
}
void A1()
{
	int x,V,L,R,y;
	read(x), read(V);
	for (st[top=1]=x,y=fa[x];y;y=fa[y]) st[++top]=y;
	int head=st[top];
	H.erase(H.find(val[head]));
	while (top) push_down(st[top--]);
	val[x]+=V, y=fa[x];
	int k=(x==son[y][1]);
	son[y][k]=fa[x]=0, L=son[x][0], R=son[x][1];
	fa[L]=fa[R]=son[x][0]=son[x][1]=0;
	L=Merge(L,R);
	if (L) fa[L]=y;
	if (y) son[y][k]=L, L=head;
	root[L]=root[x]=root[head]=Merge(x,L), root[0]=0, push_down(root[x]), H.insert(val[root[x]]);
}
void A2()
{
	int x,y;
	read(x), read(y), H.erase(H.find(val[Find(x)]));
	flag[Find(x)]+=y, push_down(root[x]), H.insert(val[root[x]]);
}
void A3() {	int x;	read(x), FLAG+=x;}
void F1()
{
	int x,y;
	read(x), push_down(x);
	if (x==root[x])	{ printf("%d\n", val[x]+FLAG); return;	}
	for (st[top=1]=x,y=fa[x];y;y=fa[y]) st[++top]=y;
	while (top) push_down(st[top--]);
	printf("%d\n",val[x]+FLAG);
}
void F2()
{
	int x;
	read(x), push_down(Find(x)), printf("%d\n",val[root[x]]+FLAG);
}
void F3()
{
	multiset<int>::iterator it=H.end();
	printf("%d\n",(*(--it))+FLAG);
}
int main()
{ 
	srand(598562895);
	read(n), Init(n), read(m);
	while (m--)
	{
		scanf("%s",ch);
		if (ch[0]=='U') U();
		else if (ch[0]=='A' && ch[1]=='1') A1();
		else if (ch[0]=='A' && ch[1]=='2') A2();
		else if (ch[0]=='A' && ch[1]=='3') A3();
		else if (ch[0]=='F' && ch[1]=='1') F1();
		else if (ch[0]=='F' && ch[1]=='2') F2();
		else if (ch[0]=='F' && ch[1]=='3') F3();
	}
	return 0;
}