#include<vector>
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 1000
using namespace std;
vector<int>vec[N];
int fa[N][N],A[N],B[N];
int deep[N],C[N],en[N],cnt,a[N];
int n,m,top[N],ans,dfn[N],st[N],x,y;
string s;
int lca(int x,int y)
{
    if(deep[x]>deep[y])
     swap(x,y);
    ;i>=;i--)
      if(deep[fa[y][i]]>=deep[x]) y=fa[y][i];
    if(x==y) return x;
    ;i>=;i--)
     if(fa[y][i]!=fa[x][i])
       x=fa[x][i],y=fa[y][i];
    ];
}
void dfs(int x)
{
    st[x]=++cnt;
    dfn[cnt]=x;
    C[x]=a[x];
    ;i<vec[x].size();i++)
    {
        deep[vec[x][i]]=deep[x]+;
        dfs(vec[x][i]);
        C[x]=min(C[x],C[vec[x][i]]);
    }
    en[x]=cnt;
}
int main()
{
    scanf("%d%d",&n,&m);
    ;i<=n;i++)
    {
        scanf(],&a[i]);
        vec[fa[i][]].push_back(i);
    }
    ]=;dfs(S);
    A[]=B[n+]=1e9;
    ;i<=n;i++)
     A[i]=min(A[i-],a[dfn[i]]);
    ;i--)
     B[i]=min(B[i+],a[dfn[i]]);
    int T,t;
    ;i<=m;i++)
    {
        cin>>s;
        ]=='E') scanf("%d",&S);
        else
        {
            scanf("%d",&T);
            t=lca(S,T);
            ]);
            else if(t!=T) printf("%d\n",C[T]);
            else
            {
                int ss=S;
                ;i>=;i--)
                 if(deep[fa[ss][i]]>deep[T]) ss=fa[ss][i];
                printf(],B[en[ss]+]));
            }
        }
    }
    ;
}