#include <cstdio>

#include <cstring>

#include <iostream>

#define lson x<<1

#define rson x<<1|1

using namespace std;

const int maxn=100010;

int n,m,cnt;

typedef long long ll;

int to[maxn],next[maxn],head[maxn],p[maxn],q[maxn],siz[maxn],son[maxn],dep[maxn],top[maxn],fa[maxn];

ll s[maxn<<2],ts[maxn<<2];

char str[10];

int rd()

{

	int ret=0,f=1;	char gc=getchar();

	while(gc<'0'||gc>'9')	{if(gc=='-')f=-f;	gc=getchar();}

	while(gc>='0'&&gc<='9')	ret=ret*10+gc-'0',gc=getchar();

	return ret*f;

}

void dfs1(int x)

{

	siz[x]=1;

	for(int i=head[x];i!=-1;i=next[i])

	{

		fa[to[i]]=x,dep[to[i]]=dep[x]+1;

		dfs1(to[i]);

		siz[x]+=siz[to[i]];

		if(siz[son[x]]<siz[to[i]])	son[x]=to[i];

	}

}

void dfs2(int x,int tp)

{

	top[x]=tp,p[x]=++p[0];

	if(son[x])	dfs2(son[x],tp);

	for(int i=head[x];i!=-1;i=next[i])

		if(to[i]!=son[x])

			dfs2(to[i],to[i]);

	q[x]=p[0];

}

void pushdown(int l,int r,int x)

{

	if(ts[x])

	{

		int mid=l+r>>1;

		ts[lson]+=ts[x],ts[rson]+=ts[x],s[lson]+=(mid-l+1)*ts[x],s[rson]+=(r-mid)*ts[x];

		ts[x]=0;

	}

}

void pushup(int x)

{

	s[x]=s[lson]+s[rson];

}

void updata(int l,int r,int x,int a,int b,ll v)

{

	if(a<=l&&r<=b)

	{

		s[x]+=(r-l+1)*v,ts[x]+=v;

		return ;

	}

	pushdown(l,r,x);

	int mid=l+r>>1;

	if(a<=mid)	updata(l,mid,lson,a,b,v);

	if(b>mid)	updata(mid+1,r,rson,a,b,v);

	pushup(x);

}

ll query(int l,int r,int x,int a,int b)

{

	if(a<=l&&r<=b)	return s[x];

	pushdown(l,r,x);

	int mid=l+r>>1;

	if(b<=mid)	return query(l,mid,lson,a,b);

	if(a>mid)	return query(mid+1,r,rson,a,b);

	return query(l,mid,lson,a,b)+query(mid+1,r,rson,a,b);

}

void add(int a,int b)

{

	to[cnt]=b,next[cnt]=head[a],head[a]=cnt++;

}

void ADD(int x,int y,ll z)

{

	while(top[x]!=top[y])

	{

		if(dep[top[x]]<dep[top[y]])	swap(x,y);

		updata(1,n,1,p[top[x]],p[x],z);

		x=fa[top[x]];

	}

	if(dep[x]>dep[y])	swap(x,y);

	updata(1,n,1,p[x],p[y],z);

}

int main()

{

	n=rd();

	int i,a,b;

	memset(head,-1,sizeof(head));

	for(i=1;i<n;i++)	a=rd()+1,b=rd()+1,add(a,b);

	dep[1]=1,dfs1(1),dfs2(1,1);

	m=rd();

	for(i=1;i<=m;i++)

	{

		scanf("%s",str);

		if(str[0]=='A')	a=rd()+1,b=rd()+1,ADD(a,b,rd());

		else	a=rd()+1,printf("%lld\n",query(1,n,1,p[a],q[a]));

	}

	return 0;

}