#include<bits/stdc++.h>
#define int long long
#define fr first
#define se second
#define pb push_back
typedef std::pair<int, int> PII;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5+5;
int dep[N], siz[N], son[N], fa[N], dfn[N], top[N], cnt = 0, val[N], w[N];
int n;
std::vector<int> g[N];

struct Node
{
    int l, r, lazy, val, MAX;
}tr[N << 2];

void push_up(int u)
{
    tr[u].val = tr[u << 1].val + tr[u << 1 | 1].val;
	tr[u].MAX = std::max(tr[u << 1].MAX, tr[u << 1 | 1].MAX);
}

void build(int u, int l, int r)
{
    tr[u].l = l, tr[u].r = r;
    if(l == r) {
		tr[u].val = val[r]; 
		tr[u].MAX = val[r];
		return ;
	}   //注意修改这里的 a[r] !!! 
    int mid = (l + r) >> 1;
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
    push_up(u);
}

///单点修改
void update(int u, int pos, int k)           ///在位置为pos的地方加上val
{
    if(tr[u].l == tr[u].r){               ///找到了这个点
        val[pos] = k;                      ///更新原数组
        tr[u].val = tr[u].MAX = k;
        return ;
    }
    int mid = (tr[u].l + tr[u].r) >> 1;
    if(pos <= mid) update(u << 1, pos, k);              ///左子节点
    else update(u << 1 | 1, pos, k);           ///右子节点
    push_up(u);                            ///更新父节点
}

int query_sum(int u, int l, int r)		///区间询问
{
    if(l <= tr[u].l && r >= tr[u].r) return tr[u].val;
    int mid = (tr[u].l + tr[u].r) >> 1;
    //push_down(u);
    int res = 0;
    if(l <= mid) res += query_sum(u << 1, l, r);
    if(r > mid) res += query_sum(u << 1 | 1, l, r);
    //push_up(u);
    return res;
}

int query_max(int u, int l, int r)
{
	if(l <= tr[u].l && r >= tr[u].r) return tr[u].MAX;
    int mid = (tr[u].l + tr[u].r) >> 1;
    int res = -1e9;
	//push_down(u);
    if(l <= mid) res = std::max(res, query_max(u << 1, l, r));
    if(r > mid) res = std::max(res, query_max(u << 1 | 1, l, r));
   // push_up(u);
    return res;
}

void dfs1(int u, int fath)
{
	dep[u] = dep[fath] + 1;
	siz[u] = 1;
	fa[u] = fath;
	int MAX = -1;
	for(int i = 0; i < g[u].size(); i++) {
		int ver = g[u][i];
		if(ver == fath) continue;
		dfs1(ver, u);
		siz[u] += siz[ver];
		if(siz[ver] > MAX) {
			MAX = siz[ver];
			son[u] = ver;
		}
	}
}

void dfs2(int u, int topf)
{
	dfn[u] = ++cnt;
	top[u] = topf;
	val[cnt] = w[u];
	if(!son[u]) return ;
	dfs2(son[u], topf);
	for(int i = 0; i < g[u].size(); i++) {
		int ver = g[u][i];
		if(ver == fa[u] || ver == son[u]) continue;
		dfs2(ver, ver);
	}
}

int path_max(int x, int y)
{
	int res = -1e9;
	while(top[x] != top[y]) {
		if(dep[top[x]] < dep[top[y]]) std::swap(x, y);
		res = std::max(res, query_max(1, dfn[top[x]], dfn[x]));
		x = fa[top[x]];
	}
	if(dep[x] > dep[y]) std::swap(x, y);
	res = std::max(query_max(1, dfn[x], dfn[y]), res);
	return res;
}

int path_sum(int x, int y)
{
	int res = 0;
	while(top[x] != top[y]) {
		if(dep[top[x]] < dep[top[y]]) std::swap(x, y);
		res += query_sum(1, dfn[top[x]], dfn[x]);
		x = fa[top[x]]; 
	}
	if(dep[x] > dep[y]) std::swap(x, y);
	res += query_sum(1, x, y);
	return res;
}

void solve()
{
	std::cin >> n;
	for(int i = 1; i < n; i++) {
		int u, ver;
		std::cin >> u >> ver;
		g[u].pb(ver); g[ver].pb(u);
	}
	for(int i = 1; i <= n; i++) std::cin >> w[i];
	dfs1(1, 0);
	dfs2(1, 1);
	build(1, 1, n);
	int q;
	std::cin >> q;
	while(q--) {
		std::string s;
		std::cin >> s;
		if(s == "CHANGE") {
			int u, t;
			std::cin >> u >> t;
			update(1, dfn[u], t);
		}
		else if(s == "QMAX") {
			int u, ver;
			std::cin >> u >> ver;
			std::cout << path_max(u, ver) << "\n";
		}
		else {
			int u, ver;
			std::cin >> u >> ver;
			std::cout << path_sum(u, ver) << "\n";
		}
	}
}

signed main() 
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(0); std::cout.tie(0);
	int T = 1;
	//std::cin >> T;
	while(T--) solve();
	return 0;
}