# include <cstdio>

# include <cstring>

# include <cstdlib>

# include <iostream>

# include <vector>

# include <queue>

# include <stack>

# include <map>

# include <set>

# include <cmath>

# include <algorithm>

using namespace std;

# define lowbit(x) ((x)&(-x))

# define pi acos(-1.0)

# define eps 1e-

# define MOD

# define INF

# define mem(a,b) memset(a,b,sizeof(a))

# define FOR(i,a,n) for(int i=a; i<=n; ++i)

# define FO(i,a,n) for(int i=a; i<n; ++i)

# define bug puts("H");

# define lch p<<,l,mid

# define rch p<<|,mid+,r

# define mp make_pair

# define pb push_back

typedef pair<int,int> PII;

typedef vector<int> VI;

# pragma comment(linker, "/STACK:1024000000,1024000000")

typedef long long LL;

int Scan() {

    int res=, flag=;

    char ch;

    if((ch=getchar())=='-') flag=;

    else if(ch>=''&&ch<='') res=ch-'';

    while((ch=getchar())>=''&&ch<='')  res=res*+(ch-'');

    return flag?-res:res;

}

void Out(int a) {

    if(a<) {putchar('-'); a=-a;}

    if(a>=) Out(a/);

    putchar(a%+'');

}

const int N=;

//Code begin...

struct Edge{int p, next;}edge[N<<];

int head[N], cnt, node[N], n;

int seg[N<<][], fa[N], size[N], dep[N], p[N], top[N], son[N], pos;

void add_edge(int u, int v){edge[cnt].p=v; edge[cnt].next=head[u]; head[u]=cnt++;}

void init(){cnt=; mem(son,-); pos=;}

void dfs(int x, int pre, int d)

{

    fa[x]=pre; dep[x]=d; size[x]=;

    for (int i=head[x]; i; i=edge[i].next) {

        int v=edge[i].p;

        if (v==pre) continue;

        dfs(v,x,d+);

        size[x]+=size[v];

        if (son[x]==-||size[v]>size[son[x]]) son[x]=v;

    }

}

void get_pos(int x, int sp)

{

    top[x]=sp; p[x]=pos++;

    if (son[x]==-) return ;

    get_pos(son[x],sp);

    for (int i=head[x]; i; i=edge[i].next) {

        int v=edge[i].p;

        if (v!=son[x]&&v!=fa[x]) get_pos(v,v);

    }

}

void push_up(int p)

{

    seg[p][]=max(seg[p<<][], seg[p<<|][]);

    seg[p][]=seg[p<<][]+seg[p<<|][];

}

void update(int p, int l, int r, int L, int val)

{

    if (L>r||L<l) return ;

    if (L==l&&L==r) seg[p][]=seg[p][]=val;

    else {

        int mid=(l+r)>>;

        update(lch,L,val); update(rch,L,val);

        push_up(p);

    }

}

int query(int p, int l, int r, int L, int R, int flag)

{

    if (L>r||R<l) {

        if (flag) return ;

        else return -INF;

    }

    if (L<=l&&R>=r) return seg[p][flag];

    int mid=(l+r)>>;

    if (flag) return query(lch,L,R,flag)+query(rch,L,R,flag);

    else return max(query(lch,L,R,flag),query(rch,L,R,flag));

}

int Qtree(int l, int r, int flag)

{

    int f1=top[l], f2=top[r], ans;

    if (flag) ans=;

    else ans=-INF;

    bool mark=false;

    while (f1!=f2) {

        mark=true;

        if (dep[f1]<dep[f2]) swap(f1,f2), swap(l,r);

        if (flag==) ans=max(ans,query(,,n,p[f1],p[l],flag));

        else ans+=query(,,n,p[f1],p[l],flag);

        l=fa[f1]; f1=top[l];

    }

    if (dep[l]>dep[r]) swap(l,r);

    if (flag==) ans=max(ans,query(,,n,p[l],p[r],flag));

    else ans+=query(,,n,p[l],p[r],flag);

    return ans;

}

int main ()

{

    int u, v, q, l, r;

    char flag[];

    init();

    scanf("%d",&n);

    FO(i,,n) scanf("%d%d",&u,&v), add_edge(u,v), add_edge(v,u);

    dfs(,,);

    get_pos(,);

    FOR(i,,n) scanf("%d",node+i), update(,,n,p[i],node[i]);

    scanf("%d",&q);

    while (q--) {

        scanf("%s%d%d",flag,&l,&r);

        if (flag[]=='C') update(,,n,p[l],r);

        else printf("%d\n",Qtree(l,r,flag[]=='S'));

    }

    return ;

}