//try
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
vector<int>to[N];
int dfn[N],dep[N],sz[N],top[N],son[N],fa[N],tt;
void dfs(int u,int f)
{
	if(f)to[u].erase(find(to[u].begin(),to[u].end(),f));
	dep[u]=dep[fa[u]=f]+1;
	sz[u]=1;
	for(int v:to[u])if(v!=f)
	{
		dfs(v,u);sz[u]+=sz[v];
		if(sz[son[u]]<sz[v])son[u]=v;
	}
}
void dfs1(int u,int f)
{
	top[u]=f;dfn[u]=++tt;if(son[u])dfs1(son[u],f);
	for(int v:to[u])if(v!=fa[u]&&v!=son[u])dfs1(v,v);
}
struct tag
{
	long long t;void TG(const tag&a){t+=a.t;}
	bool any()const{return t;}
	void clr(){t=0;}
}tg[N<<2];
struct node
{
	long long s;int len;
	void TG(const tag&a){s+=a.t*len;}
	node operator+(const node&a)const{return {s+a.s,len+a.len};}
}tr[N<<2];
inline void TG(int p,const tag&v){tr[p].TG(v),tg[p].TG(v);}
void PD(int p){if(tg[p].any())TG(p<<1,tg[p]),TG(p<<1|1,tg[p]),tg[p].clr();}
void build(int p,int l,int r){tr[p].len=r-l+1;if(l==r)return;int mid=l+r>>1;build(p<<1,l,mid),build(p<<1|1,mid+1,r);}
void mdf(int p,int l,int r,int L,int R,const tag&v)
{
	if(L>R)return;
	if(L<=l&&r<=R)return TG(p,v);
	int mid=l+r>>1;PD(p);
	if(L<=mid)mdf(p<<1,l,mid,L,R,v);
	if(R> mid)mdf(p<<1|1,mid+1,r,L,R,v);
	tr[p]=tr[p<<1]+tr[p<<1|1];
}
node qry(int p,int l,int r,int L,int R)
{
	if(L<=l&&r<=R)return tr[p];
	int mid=l+r>>1;PD(p);
	if(R<=mid)return qry(p<<1,l,mid,L,R);
	if(L> mid)return qry(p<<1|1,mid+1,r,L,R);
	return qry(p<<1,l,mid,L,R)+qry(p<<1|1,mid+1,r,L,R);
}
inline int LCA(int u,int v)
{
	while(top[u]!=top[v])
	{
		if(dep[top[u]]<dep[top[v]])swap(u,v);
		u=fa[top[u]];
	}
	return dep[u]<dep[v]?u:v;
}
long long rsu[N];
long long dep_val;//\sum dep[i]*A_i
int main()
{
	int n;cin>>n;
	for(int i=1,u,v;i<n;++i)
		cin>>u>>v,to[u].push_back(v),to[v].push_back(u);
	dfs(1,0);dfs1(1,1);
	for(int i=1;i<=n;++i)sort(to[i].begin(),to[i].end(),[=](int x,int y){return dfn[x]<dfn[y];});
	build(1,1,n);
	for(int i=1;i<=n;++i)rsu[dfn[i]]=dep[i];
	for(int i=1;i<=n;++i)rsu[i]+=rsu[i-1];
	int q;cin>>q;
	while(q--)
	{
		int o,u,v;cin>>o>>u;
		if(o==1)
		{
			cin>>v;
			if(u==v)
			{
				mdf(1,1,n,1,n,{1});
				dep_val+=rsu[n];
			}
			else if(dfn[u]<dfn[v]||dfn[u]>=dfn[v]+sz[v])
			{
//				cerr<<"CASE2\n";
				mdf(1,1,n,dfn[v],dfn[v]+sz[v]-1,{1});
				dep_val+=rsu[dfn[v]+sz[v]-1]-rsu[dfn[v]-1];
			}
			else
			{
//				cerr<<"CASE3\n";
				int w=*--upper_bound(to[v].begin(),to[v].end(),u,[=](int x,int y){return dfn[x]<dfn[y];});
//				cerr<<u<<"->"<<v<<" "<<w<<endl;
				mdf(1,1,n,1,dfn[w]-1,{1});mdf(1,1,n,dfn[w]+sz[w],n,{1});
				dep_val+=rsu[dfn[w]-1]+(rsu[n]-rsu[dfn[w]+sz[w]-1]);
			}
		}
		else if(o==2)
		{
			cin>>v;
			dep_val+=dep[u]*(dep[u]+1ll)/2;
			dep_val+=dep[v]*(dep[v]+1ll)/2;
			while(top[u]!=top[v])
			{
				if(dep[top[u]]<dep[top[v]])swap(u,v);
				mdf(1,1,n,dfn[top[u]],dfn[u],{1}),u=fa[top[u]];
			}
			if(dfn[u]>dfn[v])swap(u,v);
			mdf(1,1,n,dfn[u],dfn[v],{1});
			dep_val-=dep[u]*(dep[u]+1ll)/2;
			dep_val-=dep[u]*(dep[u]-1ll)/2;
		}
		else
		{
			long long x1=dep[u]*qry(1,1,n,1,n).s,x2=dep_val,x3=0;
			int v=u;
			while(v)x3+=qry(1,1,n,dfn[v],dfn[v]+sz[v]-1).s,v=fa[v];
//			cerr<<x1<<","<<x2<<","<<x3<<endl;
			cout<<x1+x2-x3-x3<<endl;
		}
//			for(int i=1;i<=n;++i)cerr<<qry(1,1,n,dfn[i],dfn[i]).s<<",";cerr<<endl;
	}
	return 0;
}