#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

int const maxn=;

int n,m,fa[maxn],c[maxn][],rev[maxn],mx[maxn],sum[maxn],w[maxn],sta[maxn],a[maxn],b[maxn],top;

bool isroot(int x){return c[fa[x]][]!=x && c[fa[x]][]!=x;}

void pushup(int x)

{

    int ls=c[x][],rs=c[x][];

    sum[x]=sum[ls]+sum[rs]+w[x];

    mx[x]=x;

    if(w[mx[x]]<w[mx[ls]])mx[x]=mx[ls];

    if(w[mx[x]]<w[mx[rs]])mx[x]=mx[rs];

}

void reverse(int x)

{

    if(rev[x])

    {

        rev[c[x][]]^=; rev[c[x][]]^=; rev[x]=;

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

    }

}

void rotate(int x)

{

    int y=fa[x],z=fa[y],d=(c[y][]==x);

    if(!isroot(y))c[z][c[z][]==y]=x;

    fa[x]=z; fa[y]=x; fa[c[x][!d]]=y;

    c[y][d]=c[x][!d]; c[x][!d]=y;

    pushup(y); pushup(x);

}

void splay(int x)

{

    sta[top=]=x;

    for(int i=x;!isroot(i);i=fa[i])sta[++top]=fa[i];

    for(;top;top--)reverse(sta[top]);

    for(;!isroot(x);rotate(x))

    {

        int y=fa[x],z=fa[y];

        if(isroot(y))continue;

        ((c[y][]==x)^(c[z][]==y))?rotate(x):rotate(y);

    }

}

void access(int x)

{

    for(int t=;x;splay(x),c[x][]=t,pushup(x),t=x,x=fa[x]);

}

void makeroot(int x)

{

    access(x); splay(x); rev[x]^=;

}

void link(int x,int y)

{

    makeroot(x); fa[x]=y;

}

void query(int x,int y)

{

    makeroot(x); access(y); splay(y);

}

void cut(int x,int y)

{

    query(x,y); fa[x]=; c[y][]=;

}

void change(int u,int t)

{

    makeroot(u); w[u]=t; pushup(u);//makeroot

}

int main()

{

    scanf("%d",&n); w[mx[]]=-;//!

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

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

    for(int i=;i<n;i++)link(a[i],b[i]);

    scanf("%d",&m);

    char ch[];

    for(int i=,x,y;i<=m;i++)

    {

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

        if(ch[]=='C')change(x,y);

        else

        {

            query(x,y);

            if(ch[]=='M')printf("%d\n",w[mx[y]]);

            if(ch[]=='S')printf("%d\n",sum[y]);

        }

    }

    return ;

}