#include <set>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #define N1 300010

 using namespace std;

 const int inf=0x3f3f3f3f;

 template <typename _T> void read(_T &ret)

 {

     ret=; _T fh=; char c=getchar();

     while(c<''||c>''){ if(c=='-') fh=-; c=getchar(); }

     while(c>=''&&c<=''){ ret=ret*+c-''; c=getchar(); }

     ret=ret*fh;

 }

 struct node{

 int x;

 node(int x):x(x){} node(){}

 friend bool operator < (const node &s1,const node &s2)

 { return s1.x>s2.x; }

 };

 multiset<node>s;

 struct Heap{

 #define ls ch[x][0]

 #define rs ch[x][1]

 int fa[N1],ch[N1][],h[N1],val[N1],tag[N1],stk[N1],tp;

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

 void pushdown(int x)

 {

     if(!tag[x]) return;

     val[ls]+=tag[x]; val[rs]+=tag[x];

     tag[ls]+=tag[x]; tag[rs]+=tag[x];

     tag[x]=;

 }

 int merge(int x,int y)

 {

     if(!x||!y) return x+y;

     if(val[x]<val[y]) swap(x,y);

     pushdown(x);

     ch[x][]=merge(ch[x][],y);

     fa[ch[x][]]=x;

     if(h[ch[x][]]<h[ch[x][]])

         swap(ch[x][],ch[x][]);

     h[x]=h[ch[x][]]+;

     return x;

 }

 int findfa1(int x)

 {

     tp=; stk[++tp]=x;

     while(fa[x]) stk[++tp]=fa[x], x=fa[x];

     while(tp) pushdown(stk[tp--]);

     return x;

 }

 int findfa2(int x)

 {

     while(fa[x]) x=fa[x];

     return x;

 }

 void uni(int x,int y)

 {

     x=findfa2(x), y=findfa2(y); if(x==y) return;

     s.erase(node(val[x])), s.erase(node(val[y]));

     x=merge(x,y); s.insert(node(val[x]));

 }

 void addx(int x,int w)

 {

     int y=findfa1(x),z; s.erase(node(val[y])); tp=;

     fa[ls]=fa[rs]=; z=merge(ls,rs); ls=rs=;

     ch[fa[x]][idf(x)]=; fa[x]=; val[x]+=w;

     z=merge(x,z); if(y!=x) z=merge(y,z);

     s.insert(node(val[z]));

 }

 void addsome(int x,int w)

 {

     int y=findfa2(x);

     s.erase(node(val[y]));

     val[y]+=w; tag[y]+=w;

     s.insert(node(val[y]));

 }

 int queryx(int x)

 {

     findfa1(x);

     return val[x];

 }

 int querymax(int x)

 {

     x=findfa2(x);

     return val[x];

 }

 #undef ls

 #undef rs

 }h;

 int n,Q,de;

 int main()

 {

     scanf("%d",&n);

     int i,tot=,x,y,cntf=; char str[];

     for(i=;i<=n;i++) read(h.val[i]), s.insert(node(h.val[i]));

     scanf("%d",&Q);

     for(i=;i<=Q;i++)

     {

         scanf("%s",str);

         if(str[]=='U') read(x), read(y), h.uni(x,y);

         if(str[]=='A')

         {

             switch(str[])

             {

                 case '': read(x), read(y); h.addx(x,y); break;

                 case '': read(x), read(y), h.addsome(x,y); break;

                 case '': read(y), tot+=y; break;

             }

         }

         if(str[]=='F')

         {

             cntf++;

             if(cntf==)

                 de=;

             switch(str[])

             {

                 case '': read(x), printf("%d\n",h.queryx(x)+tot); break;

                 case '': read(x), printf("%d\n",h.querymax(x)+tot); break;

                 case '': printf("%d\n",(*s.begin()).x+tot);

             }

         }

     }

     return ;

 }