1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155

#include <cstdio>
#include <vector>
#include <algorithm>
#include <cctype>
using namespace std;

namespace fast_io {
    //...
}using namespace fast_io;

const int MAXN = 110000,logn = 30;

int n,m,cnt;
int son[MAXN],dep[MAXN],fa[MAXN],siz[MAXN],top[MAXN],id[MAXN];

vector<int> edge[MAXN];

void dfs1(int nown,int f,int depth){
    siz[nown] = 1,fa[nown] = f;
    dep[nown] = depth,son[nown] = 0;
    for(int i = 0;i<edge[nown].size();i++){
        int v = edge[nown][i];
        if(v == f) continue;
        dfs1(v,nown,depth+1);
        siz[nown] += siz[v];
        if(siz[v] > siz[son[nown]]) son[nown] = v;
    }
}

void dfs2(int nown,int topf){
    top[nown] = topf;id[nown] = ++cnt;
    if(!son[nown]) return;
    dfs2(son[nown],topf);
    for(int i = 0;i < edge[nown].size();i++){
        int v = edge[nown][i];
        if(v == fa[nown] || v == son[nown]) continue;
        dfs2(v,v);
    }
}

namespace SegTree{
    int sumn[MAXN*logn],maxn[MAXN*logn],ls[MAXN*logn],rs[MAXN*logn],cnt = 0;
    #define mid ((l+r)>>1)
    void maintain(int nown){
        maxn[nown] = max(maxn[ls[nown]],maxn[rs[nown]]);
        sumn[nown] = sumn[ls[nown]] + sumn[rs[nown]];
    }
    int query_sum(int nown,int l,int r,int ql,int qr){
        if(nown == 0 || (ql <= l && r <= qr) )
            return sumn[nown];
        else{
            int ans = 0;
            if(ql <= mid) ans += query_sum(ls[nown],l,mid,ql,qr);
            if(mid+1 <= qr) ans += query_sum(rs[nown],mid+1,r,ql,qr);
            return ans;
        }
    }
    int query_max(int nown,int l,int r,int ql,int qr){
        if(nown == 0 || (ql <= l && r <= qr))
            return maxn[nown];
        else{
            int ans = 0;
            if(ql <= mid) ans = max(ans,query_max(ls[nown],l,mid,ql,qr));
            if(mid+1 <= qr) ans = max(ans,query_max(rs[nown],mid+1,r,ql,qr));
            return ans;
        }
    }
    void update(int &nown,int l,int r,int pos,int d){
        if(!nown) nown = ++cnt,ls[nown] = 0,rs[nown] = 0;
        if(l == r)
            sumn[nown] = maxn[nown] = d;
        else{
            if(pos <= mid) update(ls[nown],l,mid,pos,d);
            if(mid+1 <= pos) update(rs[nown],mid+1,r,pos,d);
            maintain(nown);
        }
    }
}

int rt[MAXN],r[MAXN],b[MAXN];


int query_max(int u,int v,int k){
    int ans = 0;
    while(top[u]!=top[v]){
        if(dep[top[u]] < dep[top[v]]) swap(u,v);
        ans = max(ans,SegTree::query_max(rt[k],1,n,id[top[u]],id[u]));
        u = fa[top[u]];
    }
    if(dep[u] > dep[v]) swap(u,v);
    ans = max(ans,SegTree::query_max(rt[k],1,n,id[u],id[v]));
    return ans;
}

int query_sum(int u,int v,int k){
    int ans = 0;
    while(top[u]!=top[v]){
        if(dep[top[u]] < dep[top[v]]) swap(u,v);
        ans += SegTree::query_sum(rt[k],1,n,id[top[u]],id[u]);
        u = fa[top[u]];
    }
    if(dep[u] > dep[v]) swap(u,v);
    ans += SegTree::query_sum(rt[k],1,n,id[u],id[v]);
    return ans;
}

void init(){
    read(n),read(m);
    for(int i = 1;i<=n;i++)
        read(r[i]),read(b[i]);
    int a,b;
    for(int i = 1;i<=n-1;i++){
        read(a),read(b);
        edge[a].push_back(b);
        edge[b].push_back(a);
    }
}

void build(){
    dfs1(1,0,1),dfs2(1,1);
    for(int i = 1;i<=n;i++)
        SegTree::update(rt[b[i]],1,n,id[i],r[i]);
}

void solve(){
    char op[10];int x,y;
    for(int i = 1;i<=m;i++){
        read(op),read(x),read(y);
        if(op[0] == 'C'){
            if(op[1] == 'W'){
                SegTree::update(rt[b[x]],1,n,id[x],y);
                r[x] = y;
            }
            else if(op[1] == 'C'){
                SegTree::update(rt[b[x]],1,n,id[x],0);
                SegTree::update(rt[y],1,n,id[x],r[x]);
                b[x] = y;
            }
        }
        else if(op[0] == 'Q'){
            if(op[1] == 'S')
                print(query_sum(x,y,b[x])),print('\n');
            else if(op[1] == 'M')
                print(query_max(x,y,b[x])),print('\n');
        }
    }
}

int main(){
    init();
    build();
    solve();
    flush();
    return 0;
}