动态树模板题。。。
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 30005
#define maxm 60005
#define eps 1e-10
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head
struct node *null;
struct node
{
int Max, sum, key;
node *fa, *ch[2];
inline bool d()
{
return fa->ch[1] == this;
}
inline bool isroot()
{
return fa == null || fa->ch[0] != this && fa->ch[1] != this;
}
inline void setc(node *p, int d)
{
ch[d] = p;
p->fa = this;
}
inline void pushup()
{
sum = ch[0]->sum + ch[1]->sum + key;
Max = max(key, max(ch[0]->Max, ch[1]->Max));
}
void rot()
{
node *f = fa, *ff = fa->fa;
int c = d(), cc = fa->d();
f->setc(ch[!c], c);
this->setc(f, !c);
if(ff->ch[cc] == f) ff->setc(this, cc);
else this->fa = ff;
f->pushup();
}
node* splay()
{
while(!isroot()) {
if(!fa->isroot()) d() == fa->d() ? fa->rot() : rot();
rot();
}
pushup();
return this;
}
node* access()
{
for(node *p = this, *q = null; p != null; q = p, p = p->fa) {
p->splay()->setc(q, 1);
p->pushup();
}
return splay();
}
};
struct Edge
{
int v;
Edge *next;
}E[maxm], *H[maxn], *edges;
node *Node[maxn];
node pool[maxm];
node *tail;
queue<int> q;
int vis[maxn];
char s[100];
int n, m;
void addedges(int u, int v)
{
edges->v = v;
edges->next = H[u];
H[u] = edges++;
}
void init()
{
tail = pool;
null = tail++;
null->key = null->Max = -INF;
null->sum = 0;
null->fa = null->ch[0] = null->ch[1] = null;
edges = E;
memset(H, 0, sizeof H);
memset(vis, 0, sizeof vis);
}
void read()
{
int u, v, x;
for(int i = 1; i < n; i++) {
scanf("%d%d", &u, &v);
addedges(u, v);
addedges(v, u);
}
for(int i = 1; i <= n; i++) {
scanf("%d", &x);
Node[i] = tail++;
Node[i]->fa = Node[i]->ch[0] = Node[i]->ch[1] = null;
Node[i]->Max = Node[i]->sum = Node[i]->key = x;
}
scanf("%d", &m);
}
void bfs()
{
q.push(1);
vis[1] = 1;
while(!q.empty()) {
int u = q.front();
q.pop();
for(Edge *e = H[u]; e; e = e->next) {
int v = e->v;
if(vis[v]) continue;
vis[v] = 1;
q.push(v);
Node[v]->fa = Node[u];
}
}
}
void change(int a, int b)
{
Node[a]->access();
Node[a]->key = b;
Node[a]->pushup();
}
int query1(node *a, node *b)
{
a->access();
for(a = null; b != null; a = b, b = b->fa) {
b->splay();
if(b->fa == null) return b->ch[1]->sum + b->key + a->sum;
b->setc(a, 1);
b->pushup();
}
}
int query2(node *a, node *b)
{
a->access();
for(a = null; b != null; a = b, b = b->fa) {
b->splay();
if(b->fa == null) return max(b->key, max(b->ch[1]->Max, a->Max));
b->setc(a, 1);
b->pushup();
}
}
void work()
{
int a, b;
bfs();
while(m--) {
scanf("%s%d%d", s, &a, &b);
if(s[0] == 'C') change(a, b);
else if(s[1] == 'S') printf("%d\n", query1(Node[a], Node[b]));
else printf("%d\n", query2(Node[a], Node[b]));
}
}
int main(void)
{
while(scanf("%d", &n)!=EOF) {
init();
read();
work();
}
return 0;
}