Rt

#include<bits/stdc++.h>
#define int long long
#define lx x<<1
#define rx x<<1|1
using namespace std;
const int N=1e5+5;
int n,_,cnt,tot;
int dfn[N],dep[N],lst[N],siz[N],f[N],son[N],Top[N];
struct edge{
	int to,nxt;
}e[N<<1];
struct Segment_tree{
	int l,r,sum,lazy;
}a[N<<2];
inline int read(){
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
	while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
	return x*f;
}
inline void add(int u,int v){
	e[++cnt].to=v;
	e[cnt].nxt=lst[u];
	lst[u]=cnt;
}
//=============================================
inline void build(int x,int l,int r){
	a[x].l=l;a[x].r=r;
	if(l==r)return;
	int mid=l+r>>1;
	build(lx,l,mid);
	build(rx,mid+1,r);
}
inline void pushdown(int x){
	if(!a[x].lazy)return;
	a[lx].sum+=(a[lx].r-a[lx].l+1)*a[x].lazy;
	a[rx].sum+=(a[rx].r-a[rx].l+1)*a[x].lazy;
	a[lx].lazy+=a[x].lazy;a[rx].lazy+=a[x].lazy;
	a[x].lazy=0;
}
inline void change(int x,int l,int r,int val){
	if(l<=a[x].l&&a[x].r<=r){
		a[x].sum+=val*(a[x].r-a[x].l+1);
		a[x].lazy+=val;
		return;
	}
	pushdown(x);
	int mid=a[x].l+a[x].r>>1;
	if(l<=mid)change(lx,l,r,val);
	if(r>mid)change(rx,l,r,val);
	a[x].sum=a[lx].sum+a[rx].sum;
}
inline int query(int x,int l,int r){
	if(l<=a[x].l&&a[x].r<=r)return a[x].sum;
	pushdown(x);
	int mid=a[x].l+a[x].r>>1,sum=0;
	if(l<=mid)sum+=query(lx,l,r);
	if(r>mid)sum+=query(rx,l,r);
	return sum;
}
//=============================================
inline void dfs1(int x,int dad){
	dep[x]=dep[dad]+1;
	f[x]=dad;siz[x]=1;
	for(int i=lst[x];i;i=e[i].nxt){
		int to=e[i].to;
		if(to==dad)continue;
		dfs1(to,x);
		if(siz[to]>siz[son[x]])son[x]=to;
		siz[x]+=siz[to];
	}
}
inline void dfs2(int x,int o){
	if(x==0)return;
	Top[x]=o;
	dfn[x]=++tot;
	dfs2(son[x],o);
	for(int i=lst[x];i;i=e[i].nxt){
		int to=e[i].to;
		if(to==f[x]||to==son[x])continue;
		dfs2(to,to);
	}
}
inline void ADD(int u,int v,int val){
	while(Top[u]!=Top[v]){
		if(dep[Top[u]]<dep[Top[v]])swap(u,v);
		int g=Top[u];
		change(1,dfn[g],dfn[u],val);
		u=f[g];
	}
	if(dep[u]>dep[v])swap(u,v);
	change(1,dfn[u],dfn[v],val);
}
signed main(){
	n=read();
	for(int i=1;i<n;i++){
		int u=read()+1,v=read()+1;
		add(u,v);add(v,u);
	}
	dfs1(1,0);
	dfs2(1,1);
	build(1,1,n);
	for(_=read();_--;){
		char c;
		scanf("%c",&c);
		if(c=='A'){
			int u=read()+1,v=read()+1,d=read();
			ADD(u,v,d);
		}
		else{
			int x=read()+1;
			printf("%lld\n",query(1,dfn[x],dfn[x]+siz[x]-1));
		}
	}
	return 0;
}