#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
typedef long long LL;
#define mem(a,b) memset(a,b,sizeof(a))
typedef pair<int,int> PII;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(!isdigit(c)){if(c==‘-‘)f=-1;c=getchar();}
    while(isdigit(c)){x=x*10+c-‘0‘;c=getchar();}
    return x*f;
}
const int maxn=30010,oo=2147483647;
struct Edge
{
    int u,v,next;
    Edge() {}
    Edge(int _1,int _2,int _3): u(_1),v(_2),next(_3) {} 
}e[2*maxn];
int n,ce=-1,m,a,b,first[maxn],sum[4*maxn],Max[4*maxn],w[maxn],pa[maxn],deep[maxn],size[maxn],id[maxn],es,bl[maxn];
char s[10];
void addEdge(int a,int b)
{
    e[++ce]=Edge(a,b,first[a]);first[a]=ce;
    e[++ce]=Edge(b,a,first[b]);first[b]=ce;
}
void dfs(int now,int fa)
{
    size[now]=1;
    for(int i=first[now];i!=-1;i=e[i].next)
    {
        if(e[i].v==fa)continue;
        deep[e[i].v]=deep[now]+1;
        pa[e[i].v]=now;
        dfs(e[i].v,now);
        size[now]+=size[e[i].v];
    }
}
void divide(int now,int chain)
{
    int maxs=0;
    id[now]=++es;bl[now]=chain;
    for(int i=first[now];i!=-1;i=e[i].next)
        if(pa[e[i].v]!=now && size[e[i].v]>size[maxs])maxs=e[i].v;
    if(!maxs)return;
    divide(maxs,chain);
    for(int i=first[now];i!=-1;i=e[i].next)
        if(pa[e[i].v]!=now && e[i].v!=maxs)divide(e[i].v,e[i].v);
}
void build(int l,int r,int o)
{
    if(l==r){sum[o]=Max[o]=w[l];return;}
    int mid=(l+r)>>1,lo=o<<1,ro=lo|1;
    build(l,mid,lo);build(mid+1,r,ro);
    sum[o]=sum[lo]+sum[ro];
    Max[o]=max(Max[lo],Max[ro]);
}
int query1(int l,int r,int o,int a,int b)
{
    int mid=(l+r)>>1,lo=o<<1,ro=lo|1;
    if(l==a && r==b)return sum[o];
    if(b<=mid)return query1(l,mid,lo,a,b);
    else if(a>mid)return query1(mid+1,r,ro,a,b);
    else return query1(l,mid,lo,a,mid)+query1(mid+1,r,ro,mid+1,b);
}
int query2(int l,int r,int o,int a,int b)
{
    int mid=(l+r)>>1,lo=o<<1,ro=lo|1;
    if(l==a && r==b)return Max[o];
    if(b<=mid)return query2(l,mid,lo,a,b);
    else if(a>mid)return query2(mid+1,r,ro,a,b);
    else return max(query2(l,mid,lo,a,mid),query2(mid+1,r,ro,mid+1,b));
}
void update(int l,int r,int o,int a,int b)
{
    if(l==r){sum[o]=Max[o]=b;return;}
    int mid=(l+r)>>1,lo=o<<1,ro=lo|1;
    if(a<=mid)update(l,mid,lo,a,b);
    else update(mid+1,r,ro,a,b);
    sum[o]=sum[lo]+sum[ro];
    Max[o]=max(Max[lo],Max[ro]); 
}
int query(int a,int b,int tp)
{
    int ans= tp ? 0 : -oo;
    while(bl[a]!=bl[b])
    {
        if(deep[bl[a]]<deep[bl[b]])swap(a,b);
        if(tp)ans+=query1(1,n,1,id[bl[a]],id[a]);
        else ans=max(ans,query2(1,n,1,id[bl[a]],id[a]));
        a=pa[bl[a]];
    }
    if(id[a]>id[b])swap(a,b);
    if(tp)ans+=query1(1,n,1,id[a],id[b]);
    else ans=max(ans,query2(1,n,1,id[a],id[b]));
    return ans;
}
int main()
{
    mem(first,-1);
    n=read();
    for(int i=1;i<n;i++)
    {
        a=read();b=read();
        addEdge(a,b);
    }
    dfs(1,1);divide(1,1);
    for(int i=1;i<=n;i++)w[id[i]]=read();
    build(1,n,1);m=read();
    while(m--)
    {
        scanf("%s",s);a=read();b=read();
        if(s[1]==‘M‘)printf("%d\n",query(a,b,0));
        else if(s[1]==‘S‘)printf("%d\n",query(a,b,1));
        else if(s[1]==‘H‘)update(1,n,1,id[a],b);
    }    
    return 0;
}