#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define lch i<<1
#define rch i<<1|1
#define N 30005
struct mzls
{
int to,nt;
}a[N*2];
struct Tree
{
int l,r,mx,sum;
}t[N*4];
int n,head[N],dep[N],top[N],siz[N],son[N],fat[N],id[N];
int cnt,tot;
inline void add(int x,int y)
{
a[cnt].to=y,a[cnt].nt=head[x],head[x]=cnt++;
}
inline void dfs(int x,int fa,int d)
{
fat[x]=fa,dep[x]=d,siz[x]=1,son[x]=0;
int s1=0;
for(int i=head[x];i!=-1;i=a[i].nt)
if(a[i].to!=fa)
{
int v=a[i].to;
dfs(v,x,d+1);
siz[x]+=siz[v];
if(siz[v]>siz[s1])
s1=v;
}
son[x]=s1;
}
inline void dfs1(int x,int tp)
{
id[x]=++tot,top[x]=tp;
if(son[x])
dfs1(son[x],tp);
for(int i=head[x];i!=-1;i=a[i].nt)
if(a[i].to!=fat[x]&&a[i].to!=son[x])
dfs1(a[i].to,a[i].to);
}
inline void Build(int i,int l,int r)
{
t[i].l=l,t[i].r=r;
if(l==r)
return;
int mid=(l+r)>>1;
Build(lch,l,mid);
Build(rch,mid+1,r);
}
inline void Up(int i)
{
t[i].mx=max(t[lch].mx,t[rch].mx);
t[i].sum=t[lch].sum+t[rch].sum;
}
inline void modify(int i,int d1,int ml)
{
if(t[i].l==t[i].r)
{
t[i].mx=t[i].sum=ml;
return;
}
int mid=(t[i].l+t[i].r)>>1;
if(d1<=mid)
modify(lch,d1,ml);
else
modify(rch,d1,ml);
Up(i);
}
inline int q1(int i,int l,int r)
{
if(t[i].r<l||t[i].l>r)
return -0x3f3f3f3f;
if(t[i].r<=r&&t[i].l>=l)
return t[i].mx;
return max(q1(lch,l,r),q1(rch,l,r));
}
inline int q2(int i,int l,int r)
{
if(t[i].r<l||t[i].l>r)
return 0;
if(t[i].r<=r&&t[i].l>=l)
return t[i].sum;
return q2(lch,l,r)+q2(rch,l,r);
}
inline int Q1(int u,int v)
{
int t1=top[u],t2=top[v];
int ans=-0x3f3f3f3f;
while(t1!=t2)
{
if(dep[t1]<dep[t2])
swap(u,v),swap(t1,t2);
ans=max(ans,q1(1,id[t1],id[u]));
u=fat[t1],t1=top[u];
}
if(dep[u]<dep[v])
swap(u,v);
ans=max(ans,q1(1,id[v],id[u]));
return ans;
}
inline int Q2(int u,int v)
{
int t1=top[u],t2=top[v];
int ans=0;
while(t1!=t2)
{
if(dep[t1]<dep[t2])
swap(u,v),swap(t1,t2);
ans+=q2(1,id[t1],id[u]);
u=fat[t1],t1=top[u];
}
if(dep[u]<dep[v])
swap(u,v);
ans+=q2(1,id[v],id[u]);
return ans;
}
int main()
{
memset(head,-1,sizeof(head));
scanf("%d",&n);
for(int i=1;i<n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
add(x,y);
add(y,x);
}
dfs(1,0,1);
dfs1(1,1);
Build(1,1,tot);
for(int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
modify(1,id[i],x);
}
int Q;
scanf("%d",&Q);
while(Q--)
{
char op[15];
int x,y;
scanf("%s%d%d",op,&x,&y);
if(op[0]=='C')
modify(1,id[x],y);
else if(op[1]=='M')
printf("%d\n",Q1(x,y));
else
printf("%d\n",Q2(x,y));
}
}