#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 1000000
using namespace std;
int n,q,sz,tot;
int w[MAXN],id[MAXN];
int dad[MAXN],deep[MAXN],size[MAXN],top[MAXN];
int to[MAXN],head[MAXN],net[MAXN];
struct nond{int l,r,dis,sum;
}tree[MAXN];
void add(int u,int v){to[++tot]=v;net[tot]=head[u];head[u]=tot;to[++tot]=u;net[tot]=head[v];head[v]=tot;
}
void up(int now){tree[now].sum=tree[now*2].sum+tree[now*2+1].sum;tree[now].dis=max(tree[now*2].dis,tree[now*2+1].dis);
}
void build(int now,int l,int r){tree[now].l=l;tree[now].r=r;if(tree[now].l==tree[now].r)return ;int mid=(tree[now].l+tree[now].r)/2;build(now*2,l,mid);build(now*2+1,mid+1,r);
}
void change(int now,int x,int k){if(tree[now].l==tree[now].r){tree[now].dis=k;tree[now].sum=k;return ;}int mid=(tree[now].l+tree[now].r)/2;if(x<=mid)    change(now*2,x,k);else if(x>mid)    change(now*2+1,x,k);up(now);
}
int query(int now,int l,int r,int z){if(tree[now].l==l&&tree[now].r==r){if(z==1)    return tree[now].dis;else if(z==0)    return tree[now].sum;}int mid=(tree[now].l+tree[now].r)/2;if(r<=mid)    return query(now*2,l,r,z);else if(l>mid)    return query(now*2+1,l,r,z);else{if(z==1)return max(query(now*2,l,mid,z),query(now*2+1,mid+1,r,z));else if(z==0)return query(now*2,l,mid,z)+query(now*2+1,mid+1,r,z);}
}
void dfs(int x){size[x]=1;deep[x]=deep[dad[x]]+1;for(int i=head[x];i;i=net[i])if(dad[x]!=to[i]){dad[to[i]]=x;dfs(to[i]);size[x]+=size[to[i]];}
}
void dfs1(int x){int t=0;id[x]=++sz;if(!top[x])    top[x]=x;change(1,sz,w[x]);for(int i=head[x];i;i=net[i])if(dad[x]!=to[i]&&size[t]<size[to[i]])t=to[i];if(t){top[t]=top[x];dfs1(t);}for(int i=head[x];i;i=net[i])if(dad[x]!=to[i]&&t!=to[i])dfs1(to[i]);
}
int squery(int x,int y,int z){int ans;if(z==1)    ans=-0x7f7f7f7f;else ans=0;while(top[x]!=top[y]){if(deep[top[x]]<deep[top[y]])    swap(x,y);if(z==1)    ans=max(ans,query(1,id[top[x]],id[x],1));else    ans+=query(1,id[top[x]],id[x],0);x=dad[top[x]];}if(id[x]>id[y])    swap(x,y);if(z==1)    ans=max(ans,query(1,id[x],id[y],1));else    ans+=query(1,id[x],id[y],0);return ans;
}
int main(){scanf("%d",&n);for(int i=1;i<n;i++){int u,v;scanf("%d%d",&u,&v);add(u,v);}for(int i=1;i<=n;i++)scanf("%d",&w[i]);build(1,1,n);dfs(1);dfs1(1);scanf("%d",&q);for(int i=1;i<=q;i++){char a[10];int u,v;scanf("%s%d%d",a,&u,&v);if(a[1]=='H')change(1,id[u],v);else if(a[1]=='M')printf("%d\n",squery(u,v,1));elseprintf("%d\n",squery(u,v,0));}
}