提交记录

#include<stdio.h>
#include<iostream>
//#include<string.h>
#include<bits/stdc++.h>
#define REG register
#define INL inline
#define lb(x) (x&(-x))
#define swap(x,y) (x^=y^=x^=y)
#define Max(x,y) (x<y?y:x)
#define Min(x,y) (x<y?x:y)
#define LL long long
INL LL max(REG LL x,REG LL y){return Max(x,y);}
INL LL min(REG LL x,REG LL y){return Min(x,y);}
using namespace std;
INL void read(REG LL&x){
	x=0;
//	REG LL fh=1;
	REG char c=getchar();
	while(c<'0'||'9'<c){
//		if(c == '-')fh=-1;
		c=getchar();
	}
	while('/'<c&&c<':'){
		x=x*10+c-48;
		c=getchar();
	}
//	x*=fh;
}
#define N 200005
#define M 400005
LL n;
LL fir[N],las[M],t[M],num;
INL void add(REG LL u,REG LL v){
	t[++num]=v;
	las[num]=fir[u];
	fir[u]=num;
}
LL fa[N],d[N],top[N],son[N],siz[N],id[N];
void dfs(LL u,LL f){
	d[u]=++d[f];
	fa[u]=f;
	siz[u]=1;
	for(REG LL i=fir[u];i;i=las[i]){
		if(t[i] == f)continue;
		dfs(t[i],u);
		siz[u]+=siz[t[i]];
		if(siz[son[u]]<siz[t[i]])son[u]=t[i];
	}
}
LL tot;
void dfs2(LL u,LL tp){
	top[u]=tp;
	id[u]=++tot;
//	cout<<u<<"::"<<tot<<endl;
//	cout<<son[u];
	if(son[u])dfs2(son[u],tp);
	for(LL i=fir[u];i;i=las[i]){
		if(t[i]== son[u]||t[i] == fa[u])continue;
		dfs2(t[i],t[i]);
	}
}

LL lazy[N<<2],Sum[N<<2];
INL void Add(REG LL now,REG LL l,REG LL r,REG LL num){
	lazy[now]+=num;
	Sum[now]+=(r-l+1)*num;
}
INL void psd(REG LL now,REG LL l,REG LL r){
	if(lazy[now] == 0)return ;
	REG LL mid=(l+r)>>1;
	Add(now<<1,l,mid,lazy[now]);
	Add((now<<1)|1,mid+1,r,lazy[now]);
	lazy[now]=0;
}
void PLS(LL now,LL l,LL r,LL x,LL y,LL num){
//	cout<<l<<','<<r<<":"<<x<<','<<y<<endl;;
	if(r<l||y<l||r<x)return ;
	if(x<=l&&r<=y){
		Add(now,l,r,num);
		return ;
	}
	psd(now,l,r);
	LL mid=(l+r)>>1;
	PLS(now<<1,l,mid,x,y,num);
	PLS((now<<1)|1,mid+1,r,x,y,num);
	Sum[now]=Sum[now<<1]+Sum[(now<<1)|1];
}
LL find(LL now,LL l,LL r,LL x,LL y){
	if(r<l||y<l||r<x)return 0;
	if(x<=l&&r<=y){
		return Sum[now];
	}
	psd(now,l,r);
	LL mid=(l+r)>>1;
	return find(now<<1,l,mid,x,y)+find((now<<1)|1,mid+1,r,x,y);
}

//----------------------------------------------------
INL void modify(REG LL x,REG LL y,REG LL num){
	while(top[x]!=top[y]){
//		cout<<"+";
		if(d[top[x]]<d[top[y]])swap(x,y);
		PLS(1,1,n,id[top[x]],id[x],num);
		x=fa[top[x]];
	}
	if(d[x]<d[y])swap(x,y);
//	cout<<x<<','<<y<<endl;
	
	PLS(1,1,n,min(id[x],id[y]),max(id[x],id[y]),num);
}


int main(){
//	freopen("tree.in","r",stdin);
//	freopen("tree.out","w",stdout);
	read(n);
	for(REG LL i=1;i<n;i++){
		REG LL x,y;
		read(x);
		read(y);
		++x,++y;//////
		add(x,y);
		add(y,x);
	}
	dfs(1,0);
	dfs2(1,1);
	LL q;
	read(q);
	while(q--){
		char c=getchar();
		while(c!='A'&&c!='Q')c=getchar();
		switch (c){
			case 'A':{
				LL x,y,num;
				read(x);
				read(y);
				read(num);
				++x,++y;//////
				modify(x,y,num);
				break;
			}
			default:{
				LL u;
				read(u);
				++u;//////
				printf("%lld\n",find(1,1,n,id[u],id[u]+siz[u]-1));
				break;
			}
		}
		
	}
	return 0;
}