de掉bug胜造七级浮屠

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define max sdafsd
using namespace std;
const int maxn=3e4+10;
inline void read(int &x)
{
    x=0;int f=1;char c=getchar();
    while((c<'0'||c>'9')&&c!='-')c=getchar();
    if(c=='-')f=-1;
    while(c<='9'&&c>='0')x=(x<<1)+(x<<3)+(c^'0'),c=getchar();
    x=x*f;
}
char cs[20];
int e,to[maxn<<1],nex[maxn<<1],beg[maxn];
int n,q,w[maxn];
int top[maxn],id[maxn],size[maxn],son[maxn],cnt,fa[maxn],dep[maxn],wt[maxn];
int sum[maxn<<2],Max[maxn<<2];
inline int max(int x,int y){return x>y?x:y;}
void build(int k,int l,int r)
{
    int mid=(l+r)>>1;
    if(l==r)
    {
        sum[k]=wt[l];
        Max[k]=wt[l];
        return;
    }
    build(k<<1,l,mid);build(k<<1|1,mid+1,r);
    sum[k]=sum[k<<1]+sum[k<<1|1];
    Max[k]=max(Max[k<<1],Max[k<<1|1]);
}
inline void add(int u,int v)
{
    to[++e]=v;
    nex[e]=beg[u];
    beg[u]=e;
}
void dfs1(int u,int f,int deep)
{
    dep[u]=deep;
    size[u]=1;
    fa[u]=f;
    for(register int i=beg[u];i;i=nex[i])
    {
        int v=to[i];
        if(v==f)continue;
        dfs1(v,u,deep+1);
        size[u]+=size[v];
        if(size[v]>size[son[u]])son[u]=v;
    }
}
void dfs2(int u,int anc)
{
    id[u]=++cnt;
    top[u]=anc;
    wt[id[u]]=w[u];
    if(!son[u])return;
    dfs2(son[u],anc);
    for(register int i=beg[u];i;i=nex[i])
    {
        int v=to[i];
        if(v==fa[u]||v==son[u])continue;
        dfs2(v,v);
    }
}
void change(int k,int l,int r,int T,int z)
{
    int mid=(l+r)>>1;
    if(l==r)
    {
        sum[k]=z;Max[k]=z;
        return;
    }
    if(T<=mid)change(k<<1,l,mid,T,z);
    else change(k<<1|1,mid+1,r,T,z);
    sum[k]=sum[k<<1]+sum[k<<1|1];
    Max[k]=max(Max[k<<1],Max[k<<1|1]);
}
int calsum(int k,int l,int r,int L,int R)
{
    int fuck=0,mid=(l+r)>>1;
    if(L<=l&&r<=R)return sum[k];
    if(L<=mid)fuck+=calsum(k<<1,l,mid,L,R);
    if(mid<R)fuck+=calsum(k<<1|1,mid+1,r,L,R);
    return fuck;
}
int calmax(int k,int l,int r,int L,int R)
{
    int fuck=-999999999,mid=(l+r)>>1;
    if(L<=l&&r<=R)return Max[k];
    if(L<=mid)fuck=max(fuck,calmax(k<<1,l,mid,L,R));
    if(mid<R)fuck=max(fuck,calmax(k<<1|1,mid+1,r,L,R));
    return fuck;
}
inline int calMax(int u,int v)
{
    int ans=-999999999;
    while(top[u]!=top[v])
    {
        if(dep[top[u]]<dep[top[v]])swap(u,v);
        ans=max(ans,calmax(1,1,n,id[top[u]],id[u]));
        u=fa[top[u]];
    }
    if(dep[u]<dep[v])swap(u,v);
    ans=max(ans,calmax(1,1,n,id[v],id[u]));
    return ans;
}
inline int calSum(int u,int v)
{
    int ans=0;
    while(top[u]!=top[v])
    {
        if(dep[top[u]]<dep[top[v]])swap(u,v);
        ans+=calsum(1,1,n,id[top[u]],id[u]);
        u=fa[top[u]];
    }
    if(dep[u]<dep[v])swap(u,v);
    ans+=calsum(1,1,n,id[v],id[u]);
    return ans;
}
int main()
{
    //freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    //printf("shit\n");
    read(n); 
    for(register int i=1;i<n;++i)
    { 
        int u,v;
        read(u),read(v);
        add(u,v),add(v,u);
    }
    //printf("fuck\n");
    for(register int i=1;i<=n;++i)read(w[i]);
    dfs1(1,0,1);
    dfs2(1,1);
    build(1,1,n);
    read(q);
    while(q--)
    {
        scanf("%s",cs);
        int x,y;
        read(x),read(y);
        if(cs[0]=='C')change(1,1,n,id[x],y);
        else if(cs[0]=='Q'&&cs[1]=='M')printf("%d\n",calMax(x,y));
        else printf("%d\n",calSum(x,y));
    }
    return 0;
}