给出一棵树,每次查询一个点到根的路径边权和,有边修改。直接差分+树状数组。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 250010
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,c[N],dep[N],fa[N],in[N],out[N],dfn=0,h[N],num=0,id[N];
struct edge{
int to,next;
}data[N<<1];
inline void add(int x,int y){
data[++num].to=y;data[num].next=h[x];h[x]=num;
data[++num].to=x;data[num].next=h[y];h[y]=num;
}
inline void dfs(int x){
in[x]=++dfn;id[dfn]=x;
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(y==fa[x]) continue;
fa[y]=x;dep[y]=dep[x]+1;dfs(y);
}out[x]=dfn;
}
inline void addc(int x,int val){
for(;x<=n;x+=x&-x) c[x]+=val;
}
inline int ask(int x){
int res=0;for(;x;x-=x&-x) res+=c[x];return res;
}
int main(){
// freopen("a.in","r",stdin);
n=read();
for(int i=1;i<n;++i){
int x=read(),y=read();add(x,y);
}dfs(1);int owo=read()+n-1;
for(int i=1;i<=n;++i) addc(i,dep[id[i]]-dep[id[i-1]]);
while(owo--){
char op[5];scanf("%s",op+1);
if(op[1]=='W') printf("%d\n",ask(in[read()]));
else{
int x=read(),y=read();if(dep[y]>dep[x]) swap(x,y);
addc(in[x],-1);addc(out[x]+1,1);
}
}return 0;
}