#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define N 30005
#define M 60005
using namespace std;
struct linetree{int l,r,s,m;
}lt[M];
struct graph{int nxt,to;
}e[M];
char c[10];
int g[N],w[N],ww[N],n,q,u,v,cnt;
int f[N],p[N],dep[N],siz[N],son[N],top[N];
/*top[u]:u所在的链的顶端节点,son[u]:u的重儿子*/
inline void addedge(int x,int y){e[++cnt].nxt=g[x];g[x]=cnt;e[cnt].to=y;
}
inline void dfs1(int u){int m=0;siz[u]=1;for(int i=g[u];i;i=e[i].nxt)if(!dep[e[i].to]){f[e[i].to]=u;dep[e[i].to]=dep[u]+1;dfs1(e[i].to);siz[u]+=siz[e[i].to];if(siz[e[i].to]>m){son[u]=e[i].to;m=siz[e[i].to];}}
}
inline void dfs2(int u,int tp){top[u]=tp;p[u]=++cnt;ww[cnt]=w[u];if(son[u]) dfs2(son[u],tp);for(int i=g[u];i;i=e[i].nxt){if(e[i].to!=f[u]&&e[i].to!=son[u])dfs2(e[i].to,e[i].to);}
}
inline void build(int u,int l,int r){lt[u].l=l;lt[u].r=r;if(lt[u].l<lt[u].r){int lef=u<<1,rig=u<<1|1;int mid=(lt[u].l+lt[u].r)>>1;build(lef,l,mid);build(rig,mid+1,r);lt[u].s=lt[lef].s+lt[rig].s;lt[u].m=max(lt[lef].m,lt[rig].m);}else lt[u].s=lt[u].m=ww[lt[u].l];
}
inline void cover(int u,int x,int k){if(lt[u].l<lt[u].r){int lef=u<<1,rig=u<<1|1;int mid=(lt[u].l+lt[u].r)>>1;if(x<=mid) cover(lef,x,k);else cover(rig,x,k); lt[u].s=lt[lef].s+lt[rig].s;lt[u].m=max(lt[lef].m,lt[rig].m);}else lt[u].s=lt[u].m=k;
}
inline int sum(int u,int l,int r){if(lt[u].l>=l&&lt[u].r<=r)return lt[u].s;if(lt[u].l<lt[u].r){int lef=u<<1,rig=u<<1|1,ret=0;int mid=(lt[u].l+lt[u].r)>>1;if(l<=mid) ret+=sum(lef,l,r);if(r>mid) ret+=sum(rig,l,r);return ret;}
}
inline int qsum(int x,int y){int ret=0;while(top[x]!=top[y]){if(dep[top[x]]>dep[top[y]]){ret+=sum(1,p[top[x]],p[x]);x=f[top[x]];}else{ret+=sum(1,p[top[y]],p[y]);y=f[top[y]];}}if(p[x]>p[y]){int t=x;x=y;y=t;}ret+=sum(1,p[x],p[y]);return ret;
}
inline int ask(int u,int l,int r){if(lt[u].l>=l&&lt[u].r<=r)return lt[u].m;if(lt[u].l<lt[u].r){int lef=u<<1,rig=u<<1|1,ret=-30000;int mid=(lt[u].l+lt[u].r)>>1;if(l<=mid) ret=max(ret,ask(lef,l,r));if(r>mid) ret=max(ret,ask(rig,l,r));return ret;}
}
inline int qmax(int x,int y){int ret=-30000;while(top[x]!=top[y]){if(dep[top[x]]>dep[top[y]]){ret=max(ret,ask(1,p[top[x]],p[x]));x=f[top[x]];}else{ret=max(ret,ask(1,p[top[y]],p[y]));y=f[top[y]];}}if(p[x]>p[y]){int t=x;x=y;y=t;}ret=max(ret,ask(1,p[x],p[y]));return ret;
}
inline void Aireen(){scanf("%d",&n);for(int i=1,x,y;i<n;++i){scanf("%d%d",&x,&y);addedge(x,y);addedge(y,x);}for(int i=1;i<=n;++i)scanf("%d",&w[i]);dep[1]=1;dfs1(1);cnt=0;dfs2(1,1);build(1,1,n);scanf("%d",&q);while(q--){scanf("%s%d%d",c,&u,&v);if(c[1]=='H') cover(1,p[u],v);else if(c[1]=='M') printf("%d\n",qmax(u,v));else printf("%d\n",qsum(u,v));}
}
int main(){freopen("count.in","r",stdin);freopen("count.out","w",stdout);Aireen();fclose(stdin);fclose(stdout);return 0;
}