#include"iostream"
using namespace std;
typedef long long ll;
const ll N=1e6+10;
ll n,num[N];
struct seg_tree
{
	#define ls (i<<1)
	#define rs (ls|1)
	#define mid (l+((r-l)>>1))
	ll maxx[N<<2],sum[N<<2];
	void build(ll i,ll l,ll r)
	{
		if(l==r) maxx[i]=sum[i]=num[l];
		else 
		{
			build(ls,l,mid),build(rs,mid+1,r);
			sum[i]=sum[ls]+sum[rs];
			maxx[i]=max(maxx[ls],maxx[rs]);
		}
	}
	void add(ll i,ll l,ll r,ll pos,ll k)
	{
		if(l==r) 
		{
			sum[i]=maxx[i]=k;
			return ;
		}
		else if(pos<=mid) add(ls,l,mid,pos,k);
		else add(rs,mid+1,r,pos,k);
		sum[i]=sum[ls]+sum[rs];
		maxx[i]=max(maxx[ls],maxx[rs]);
	}
	ll querymaxx(ll i,ll l,ll r,ll L,ll R)
	{
		if(l>R||r<L) return 0;
		else if(L<=l&&R>=r) return maxx[i];
		else return max(querymaxx(ls,l,mid,L,R),querymaxx(rs,mid+1,r,L,R));
	}
	ll querysum(ll i,ll l,ll r,ll L,ll R)
	{
		//cout<<l<<" "<<r<<" "<<sum[i]<<"\n";
		if(l>R||r<L) return 0;
		else if(L<=l&&R>=r) return sum[i];
		else return querysum(ls,l,mid,L,R)+querysum(rs,mid+1,r,L,R);
	}
}seg;
struct Edge
{
	ll to,next;
}edge[N];
ll head[N],cnt1;
void addedge(ll u,ll v)
{
	cnt1++;
	edge[cnt1].to=v;
	edge[cnt1].next=head[u];
	head[u]=cnt1;
}
ll dep[N],fa[N],siz[N],son[N];
void dfs1(ll x)
{
	siz[x]=1;
	for(ll i=head[x];i;i=edge[i].next)
	{
		ll to=edge[i].to;
		if(to==fa[x]) continue;
		fa[to]=x;
		dep[to]=dep[x]+1;
		dfs1(to);
		siz[x]+=siz[to];
		if(siz[son[x]]<siz[to]) son[x]=to;
	}
}
ll cnt2,top[N],id[N];
void dfs2(ll x,ll rt)
{
	id[x]=++cnt2;
	top[x]=rt;
	if(son[x]) dfs2(son[x],rt);
	for(ll i=head[x];i;i=edge[i].next)
	{
		ll to=edge[i].to;
		if(to==fa[x]||to==son[x]) continue;
		dfs2(to,to);
	}
}
void change(ll u,ll t)
{
	seg.add(1,1,n,id[u],t);
}
ll Qmax(ll u,ll v)
{
	ll ans=0;
	while(top[u]!=top[v])
	{
		//cout<<u<<" "<<v<<"\n";
		if(dep[top[u]]<dep[top[v]]) swap(u,v);
		ans=max(seg.querymaxx(1,1,n,id[top[u]],id[u]),ans);
		u=fa[top[u]];
	}
	if(dep[u]<dep[v]) swap(u,v);
	ans=max(seg.querymaxx(1,1,n,id[v],id[u]),ans);
	return ans;
}
ll Qsum(ll u,ll v)
{
	ll ans=0;
	while(top[u]!=top[v])
	{
		//cout<<u<<" "<<v<<"\n";
		if(dep[top[u]]<dep[top[v]]) swap(u,v);
		//cout<<id[u]<<" "<<id[top[u]]<<"\n";
		ans+=seg.querysum(1,1,n,id[top[u]],id[u]);
		u=fa[top[u]];
	}
	//cout<<u<<" "<<v<<"\n";
	if(dep[u]<dep[v]) swap(u,v);
	ans+=seg.querysum(1,1,n,id[v],id[u]);
	return ans;
}
void solve()
{
	cin>>n;
	for(ll i=1;i<n;i++)
	{
		ll u,v;
		cin>>u>>v;
		addedge(u,v);
		addedge(v,u);
	}
	dfs1(1);
	dfs2(1,1);
	for(int i=1;i<=n;i++) cin>>num[id[i]];
	seg.build(1,1,n);
	ll m;
	cin>>m;
	for(ll i=1;i<=m;i++)
	{
		ll u,v;
		string op;
		cin>>op>>u>>v;
		if(op=="CHANGE") change(u,v);
		else if(op=="QMAX") cout<<Qmax(u,v)<<"\n";
		else cout<<Qsum(u,v)<<"\n";
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	solve();
	return 0;
}