#include<bits/stdc++.h>
using namespace std;

#define int long long
const int maxn = 1e5 + 10;
const int inf = 1e10;

struct node{
	int l, r, sum, mx;
}tree[maxn << 2];

int n, x, y, q, dfs_clock;
int id[maxn], rnk[maxn], son[maxn], sz[maxn];
int d[maxn], f[maxn], top[maxn], a[maxn];
string s;
vector<int>g[maxn];

void dfs1(int u, int fa){
	d[u] = d[fa] + 1, sz[u] = 1, f[u] = fa;
	for(int i = 0; i < g[u].size(); i++){
		int v = g[u][i];
		if(fa == v) continue;
		dfs1(v, u);
		sz[u] += sz[v];
		if(sz[v] > sz[son[u]]) son[u] = v;
	}
}

void dfs2(int u, int tp){
	top[u] = tp, id[u] = ++dfs_clock, rnk[dfs_clock] = u;
	if(!son[u]) return;
	dfs2(son[u], tp);
	for(int i = 0; i < g[u].size(); i++){
		int v = g[u][i];
		if(f[u] == v || v == son[u]) continue;
		dfs2(v, v);
	}
}

void push_up(int i){
	tree[i].sum = tree[i*2].sum + tree[i*2+1].sum;
	tree[i].mx = max(tree[i*2].mx, tree[i*2+1].mx);
}

void build(int i, int l, int r){
	tree[i].l = l, tree[i].r = r, tree[i].sum = 0, tree[i].mx = -inf;
	if(l == r){
		tree[i].sum = tree[i].mx = a[rnk[l]];
		return;
	}
	int mid = l + r >> 1;
	build(i * 2, l, mid);
	build(i * 2 + 1, mid + 1, r);
	push_up(i);
}

void update(int i, int x, int y){
	int l = tree[i].l, r = tree[i].r;
	if(l == r){
		tree[i].sum = tree[i].mx = y;
		return;
	}
	int mid = l + r >> 1;
	if(mid >= x) update(i * 2, x, y);
	else update(i * 2 + 1, x, y);
	push_up(i);
}

int query_sum(int i, int x, int y){
	int l = tree[i].l, r = tree[i].r;
	if(x <= l && r <= y) return tree[i].sum;
	int mid = l + r >> 1, res = 0;
	if(mid >= x) res += query_sum(i * 2, x, y);
	if(mid < y) res += query_sum(i * 2 + 1, x, y);
	return res;
}

int query_max(int i, int x, int y){
	int l = tree[i].l, r = tree[i].r;
	if(x <= l && r <= y) return tree[i].mx;
	int mid = l + r >> 1, res = -inf;
	if(mid >= x) res = max(res, query_max(i * 2, x, y));
	if(mid < y) res = max(res, query_max(i * 2 + 1, x, y));
	return res;
}

int qmax(int x, int y){
	int res = -inf;
	while(top[x] != top[y]){
		if(d[top[x]] < d[top[y]]) swap(x, y);
		res = max(res, query_max(1, id[top[x]], top[x]));
		x = f[top[x]];
	}
	if(d[x] > d[y]) swap(x, y);
	res = max(res, query_max(1, id[x], id[y]));
	return res;
}

int qsum(int x, int y){
	int res = 0;
	while(top[x] != top[y]){
		if(d[top[x]] < d[top[y]]) swap(x, y);
		res += query_sum(1, id[top[x]], top[x]);
		x = f[top[x]];
	}
	if(d[x] > d[y]) swap(x, y);
	res += query_sum(1, id[x], id[y]);
	return res;
}

signed main(){
	ios::sync_with_stdio(0);
	cin >> n;
	for(int i = 1; i < n; i++){
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	for(int i = 1; i <= n; i++) cin >> a[i];
	dfs_clock = 0;
	dfs1(1, 0); dfs2(1, 1);
	build(1, 1, n);
	cin >> q;
	while(q--){
		cin >> s >> x >> y;
		if(s == "QMAX") cout << qmax(x, y) << endl;
		else if(s == "QSUM") cout << qsum(x, y) << endl;
		else update(1, id[x], y);
	}
	return 0;
}