#include<bits/stdc++.h>
using namespace std;
int n,m;
#define ull unsigned long long
struct SGT{
	ull su[801000],tg[801000];int le[801000];
	void build(int p,int l,int r){
		le[p]=r-l+1,su[p]=tg[p]=0;if(l==r)return;int mid=(l+r)>>1;
		build(p<<1,l,mid),build(p<<1|1,mid+1,r);
	}
	void ad(int p,ull z){su[p]+=z*le[p],tg[p]+=z;}
	void pd(int p){
		if(tg[p])ad(p<<1,tg[p]),ad(p<<1|1,tg[p]),tg[p]=0;
	}
	void up(int p,int l,int r,int x,int y,ull z){
		if(x<=l&&r<=y)return ad(p,z);pd(p);int mid=(l+r)>>1;
		if(x<=mid)up(p<<1,l,mid,x,y,z);
		if(y>mid)up(p<<1|1,mid+1,r,x,y,z);
		su[p]=su[p<<1]+su[p<<1|1];
	}
	ull ask(int p,int l,int r,int x,int y){
		if(x<=l&&r<=y)return su[p];pd(p);int mid=(l+r)>>1;
		ull ts=0;
		if(x<=mid)ts+=ask(p<<1,l,mid,x,y);
		if(y>mid)ts+=ask(p<<1|1,mid+1,r,x,y);
		return ts;
	} 
}T,T1,T2,T3;
vector<int>G[201000];
namespace Sub1{
	ull va[5010];
	vector<int>fz;
	int fa[5010];bool vc[5010];
	void dfs1(int x){for(int v:G[x])if(v!=fa[x])fa[v]=x,dfs1(v);}
	void dfs2(int x,int z){
		if(!vc[x])z--;if(z<0)return;
		fz.push_back(x);
		for(int v:G[x])if(v!=fa[x])dfs2(v,z);
	}
	void gt(int u,int v,int k){
		fz.clear();
		memset(fa,0,sizeof(fa));
		dfs1(u);memset(vc,0,sizeof(vc));int o=v;while(o)vc[o]=1,o=fa[o];
		dfs2(u,k);
	}
	int sz[5010],dfn[5010],bel[5010];
	void dfs(int x,int f){
		sz[x]=1,bel[dfn[x]=++dfn[0]]=x;
		for(int v:G[x])if(v!=f)dfs(v,x),sz[x]+=sz[v];
	}
	void sol(){
		dfs(1,0);
		for(int ii=1,op,u,v,k;ii<=m;ii++){
			ull z;
			scanf("%d%d",&op,&u);
			if(op==1||op==3){
				scanf("%d%d",&v,&k);
				gt(u,v,k);
				if(op==1){
					scanf("%llu",&z);
					for(int x:fz)va[x]+=z;
				}
				else{
					ull su=0;
					for(int x:fz)su+=va[x];
					printf("%llu\n",su);
				}
			}
			else{
				if(op==2){
					scanf("%llu",&z);
					for(int i=dfn[u];i<dfn[u]+sz[u];i++)va[bel[i]]+=z;
				}
				else{
					ull su=0;
					for(int i=dfn[u];i<dfn[u]+sz[u];i++)su+=va[bel[i]];
					printf("%llu\n",su); 
				}
			}
		}
	}
}
namespace Sub3{
	void sol(){
		T.build(1,1,n);
		for(int i=1,op,u,v,k;i<=m;i++){
			ull z;scanf("%d%d",&op,&u);
			if(op==1||op==3){
				scanf("%d%d",&v,&k);if(u>v)swap(u,v);
				u=max(1,u-k),v=min(n,v+k);
				if(op==1)scanf("%llu",&z),T.up(1,1,n,u,v,z);
				else printf("%llu\n",T.ask(1,1,n,u,v));
			}
			else{
				if(op==2)scanf("%llu",&z),T.up(1,1,n,u,n,z);
				else printf("%llu\n",T.ask(1,1,n,u,n));
			}
		}
	}
}
#define pb push_back
int OP[200100],U[201000],V[201000],K[201000];ull Z[201000];
namespace Sub2{
	int sz[200100],dfn[201000],bel[201000],fa[201000],top[201000],son[201000],d[200100];
	void dfs(int x){
		sz[x]=1;int mm=-1;
		for(int v:G[x])if(v!=fa[x]){
			d[v]=d[x]+1,fa[v]=x,dfs(v),sz[x]+=sz[v];
			if(mm<sz[v])mm=sz[v],son[x]=v;
		}
	}
	void dfs2(int x,int ff){
		bel[dfn[x]=++dfn[0]]=x,top[x]=ff;if(!son[x])return;
		dfs2(son[x],ff);
		for(int v:G[x])if(v!=fa[x]&&v!=son[x])dfs2(v,v);
	}
	void sol(){
		T.build(1,1,n);
		dfs(1),dfs2(1,1);
		for(int i=1;i<=m;i++){
			int o=OP[i],u=U[i];
			if(o==2)T.up(1,1,n,dfn[u],dfn[u]+sz[u]-1,Z[i]);
			if(o==4)printf("%llu\n",T.ask(1,1,n,dfn[u],dfn[u]+sz[u]-1));
			if(o==1||o==3){
				int v=V[i];ull su=0;
				while(top[u]!=top[v]){
					if(d[top[u]]<d[top[v]])swap(u,v);
					if(o==1)T.up(1,1,n,dfn[top[u]],dfn[u],Z[i]);
					else su+=T.ask(1,1,n,dfn[top[u]],dfn[u]);
					u=fa[top[u]];
				}
				if(d[u]>d[v])swap(u,v);
				if(o==1)T.up(1,1,n,dfn[u],dfn[v],Z[i]);
				else su+=T.ask(1,1,n,dfn[u],dfn[v]),printf("%llu\n",su);
			}
		}
	}
}
namespace Sub45{
	int dfn[200100],d[201000],fa[201000];
	void dfs(int x){
		dfn[x]=++dfn[0];
		for(int v:G[x])if(v!=fa[x])fa[v]=x,d[v]=d[x]+1,dfs(v);
	}
	int jd[201000],L[201000][4],R[201000][4],be[201000];
	void dfs2(int x){
		for(int i=0;i<4;i++)L[x][i]=n+1,R[x][i]=-1;
		L[x][0]=R[x][0]=jd[x];
		for(int v:G[x])if(v!=fa[x]){
			dfs2(v);
			for(int i=0;i<3;i++)L[x][i+1]=min(L[x][i+1],L[v][i]),
			R[x][i+1]=max(R[x][i+1],R[v][i]);
		}
	}
	void sol(){
		dfs(1);
		for(int i=1;i<=n;i++)be[i]=i;
		sort(be+1,be+n+1,[&](int x,int y){if(d[x]!=d[y])return d[x]<d[y];return dfn[x]<dfn[y];});
		for(int i=1;i<=n;i++)jd[be[i]]=i;
		dfs2(1);
		T.build(1,1,n); 
		for(int i=1;i<=m;i++){
			int o=U[i],z=K[i];
			ull su=0;
			while(o&&z>=0){
				for(int j=max(0,((o==1)?0:(z-1)));j<=z;j++){
					if(L[o][j]>R[o][j])continue;
					if(OP[i]==1)T.up(1,1,n,L[o][j],R[o][j],Z[i]);
					else su+=T.ask(1,1,n,L[o][j],R[o][j]);
				}
				o=fa[o],z--;
			}
			if(OP[i]==3)printf("%llu\n",su);
		}
	}
}
namespace Sub6{
	int dfn[200100],d[201000],fa[201000],sz[201000];
	void dfs(int x){
		dfn[x]=++dfn[0],sz[x]=1;
		for(int v:G[x])if(v!=fa[x])fa[v]=x,d[v]=d[x]+1,dfs(v),sz[x]+=sz[v];
	}
	int jd[201000],L[201000][4],R[201000][4],be[201000];
	void dfs2(int x){
		for(int i=0;i<4;i++)L[x][i]=n+1,R[x][i]=-1;
		L[x][0]=R[x][0]=jd[x];
		for(int v:G[x])if(v!=fa[x]){
			dfs2(v);
			for(int i=0;i<3;i++)L[x][i+1]=min(L[x][i+1],L[v][i]),
			R[x][i+1]=max(R[x][i+1],R[v][i]);
		}
	}
	ull cg[200100][4],gc[200100][4];
	void sol(){
		dfs(1);
		for(int i=1;i<=n;i++)be[i]=i;
		sort(be+1,be+n+1,[&](int x,int y){if(d[x]!=d[y])return d[x]<d[y];return dfn[x]<dfn[y];});
		for(int i=1;i<=n;i++)jd[be[i]]=i;
		dfs2(1);
		T.build(1,1,n),T1.build(1,1,n),T2.build(1,1,n),T3.build(1,1,n);
		for(int i=1;i<=n;i++){
			if(OP[i]==1){
				int o=U[i],z=K[i];
				while(o&&z>=0){
					for(int j=max(0,((o==1)?0:(z-1)));j<=z;j++){
						if(L[o][j]>R[o][j])continue;
						cg[o][j]+=Z[i];
						T.up(1,1,n,L[o][j],R[o][j],Z[i]);
						if(o!=1)T2.up(1,1,n,dfn[fa[o]],dfn[fa[o]],Z[i]*(R[o][j]-L[o][j]+1));
					}
					o=fa[o],z--;
				}
			}
			if(OP[i]==2){
				int o=U[i],u=o;
				T1.up(1,1,n,dfn[o],dfn[o]+sz[o]-1,Z[i]);
				if(sz[o]>1)T3.up(1,1,n,dfn[o]+1,dfn[o]+sz[o]-1,Z[i]);
				while(o&&d[u]-d[o]<=3){
					for(int j=0;j<=3-(d[u]-d[o]);j++)if(L[u][j]<=R[u][j])
					gc[o][j+d[u]-d[o]]+=Z[i]*(R[u][j]-L[u][j]+1);
					o=fa[o];
				}
			}
			if(OP[i]==3){
				int o=U[i],z=K[i];
				ull su=0;
				while(o&&z>=0){
					for(int j=max(0,((o==1)?0:(z-1)));j<=z;j++){
						if(L[o][j]>R[o][j])continue;
						su+=T.ask(1,1,n,L[o][j],R[o][j]);
						su+=T3.ask(1,1,n,dfn[o],dfn[o])*(R[o][j]-L[o][j]+1);
						su+=gc[o][j];
					}
					o=fa[o],z--;
				}
				printf("%llu\n",su);
			}
			if(OP[i]==4){
				int o=U[i],u=o;
				ull su=T1.ask(1,1,n,dfn[o],dfn[o]+sz[o]-1)+T2.ask(1,1,n,dfn[o],dfn[o]+sz[o]-1);
				while(o&&d[u]-d[o]<=3){
					for(int j=0;j<=3-(d[u]-d[o]);j++)if(L[u][j]<=R[u][j])su+=cg[o][d[u]-d[o]+j]*(R[u][j]-L[u][j]+1);
					o=fa[o];
				}
				printf("%llu\n",su);
			}
		}
	}
}
int main(){
	scanf("%d%d",&n,&m);bool fl=1;
	for(int i=1,u,v;i<n;i++)scanf("%d%d",&u,&v),fl&=(abs(u-v)==1),G[u].pb(v),G[v].pb(u);
	if(n<=5000&&m<=5000){Sub1::sol();return 0;}
	if(fl){Sub3::sol();return 0;}
	bool p1=1,p2=1,p3=1;
	for(int i=1;i<=m;i++){
		scanf("%d%d",&OP[i],&U[i]);
		if(OP[i]==1||OP[i]==3)scanf("%d%d",&V[i],&K[i]),p1&=(U[i]==V[i]),p2&=(K[i]==0),p3&=(U[i]==V[i]);
		if(OP[i]==1||OP[i]==2)scanf("%llu",&Z[i]);
		if(OP[i]==2||OP[i]==4)p1=0;
	}
	if(p2){Sub2::sol();return 0;}
	if(p1){Sub45::sol();return 0;}
	if(p3){Sub6::sol();return 0;}
	return 0;
}