// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
using namespace std;
inline ll read()
{
    char c=getchar();ll x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 400005
#define inf 0x3f3f3f3f

mt19937_64 rng(114);

int n;

struct dat{
	ull c,s;
	dat(ull x=0,ull y=0){c=x,s=y;}
	void add(ull x){
		s+=c*x;
	}
};
dat operator +(dat a,dat b){
	return dat(a.c+b.c,a.s+b.s);
}
dat operator -(dat a,dat b){
	return dat(a.c-b.c,a.s-b.s);
}
void operator +=(dat &a,dat b){
	a.c+=b.c,a.s+=b.s;
}
void operator -=(dat &a,dat b){
	a.c-=b.c,a.s-=b.s;
}

struct node{
	dat s0,s[4];
	node(){
		s0=0;
		For(i,0,3)s[i]=0;
	}
};
node operator +(node a,node b){
	a.s0+=b.s0;
	For(i,0,3)a.s[i]+=b.s[i];
	return a;
}
//void operator +=(node&a,node b){
//	a=a+b;
//}

struct oper{
	ull t0,t[4];
	oper(){
		t0=0;
		For(i,0,3)t[i]=0;
	}
	bool emp(){
		For(i,0,3)if(t[i])return 0;
		if(t0)return 0;
		return 1;
	}
};
void operator +=(oper &a,oper b){
	For(i,0,3)a.t[i]+=b.t[i];
}
void operator +=(node &a,oper b){
	a.s0.add(b.t0);
	For(i,0,3){
		a.s[i].add(b.t0);
		if(b.t[i]) a.s0.s+=a.s[i].c*b.t[i],a.s[i].add(b.t[i]);
	}
}

oper mov(oper a){
	For(i,0,2)a.t[i]=a.t[i+1];
	a.t[3]=0;
	return a;
}
node movup(node a){
	Rep(i,3,1)a.s[i]=a.s[i-1]; a.s[0]=0;
	return a;
}

namespace T{
	int rt[maxn],ls[maxn],rs[maxn];
	node v[maxn],s[maxn];
	oper tag[maxn],tag2[maxn];
	unsigned rnd[maxn];
	void up(int x){
		s[x]=s[ls[x]]+v[x]+s[rs[x]];
	}
	void pt(int x,oper y){
		if(!x)return;
		tag[x]+=y;
		tag2[x]+=y;
		v[x]+=y;
		s[x]+=y;
	}
	void down(int x){
		if(!x || tag[x].emp())return;
		pt(ls[x],tag[x]),pt(rs[x],tag[x]),tag[x]=oper();
	}
	void split(int p,int k,int&x,int&y){
		if(!p)return x=y=0,void();
		down(p);
		if(p<=k)x=p,split(rs[p],k,rs[p],y);
		else y=p,split(ls[p],k,x,ls[p]); up(p); 
	}
	void split(int p,int k,int&x,int&y,int&z){
		int t;
		split(p,k-1,x,t);
		split(t,k,y,z);
	}
	int merge(int x,int y){
		if(!x||!y)return x|y;
		down(x),down(y);
		if(rnd[x]<rnd[y])return rs[x]=merge(rs[x],y),up(x),x;
		return ls[y]=merge(x,ls[y]),up(y),y;
	}
	void ins(int&p,int x){
		if(!p||rnd[x]<rnd[p]){
			split(p,x,ls[x],rs[x]);
			p=x,up(p);return;
		}
		down(p);
		if(x<=p)ins(ls[p],x);
		else ins(rs[p],x);
		up(p);
	}
	void del(int&p,int x){
		down(p);
		if(p==x){
			p=merge(ls[p],rs[p]);
			return;
		}
		if(x<p)del(ls[p],x);
		else del(rs[p],x);
		up(p);
	}
};

#define ls(x) ch[x][0]
#define rs(x) ch[x][1]
int fa[maxn],ch[maxn][2];
oper tag[maxn];
node v[maxn],s[maxn];
bool rev[maxn];

bool chk(int x){return rs(fa[x])==x;}
bool nrt(int x){return ls(fa[x])==x||rs(fa[x])==x;}
void up(int x){
	s[x]=s[ls(x)]+v[x]+s[rs(x)]+movup(T::s[T::rt[x]]);
}
void pr(int x){
	rev[x]^=1;
	swap(ls(x),rs(x));
}
void update(int u,ull x){
//	if(x)cerr<<"update "<<u<<" "<<x<<"\n";
	oper t;
	t.t[0]=x;
	v[u]+=t;
}

void pt(int x,oper y){
	if(!x || y.emp())return;
	assert(x);
	tag[x]+=y;
	
//	cout<<"pushtag "<<x<<"\n";
//	For(i,0,3)cout<<y.t[i]<<" "; cout<<"\n";
	update(x,y.t0+y.t[0]);
	
	s[x]+=y;
	T::pt(T::rt[x],mov(y));
}

void down(int x){
	if(rev[x]){
		if(ls(x))pr(ls(x));
		if(rs(x))pr(rs(x));
		rev[x]=0;
	}
	if(!tag[x].emp()){
		if(ls(x))pt(ls(x),tag[x]);
		if(rs(x))pt(rs(x),tag[x]);
		tag[x]=oper();
	}
}

void downall(int p){
	if(nrt(p))downall(fa[p]);
	down(p);
}
void rot(int x){
	int y=fa[x],z=fa[y],k=chk(x),s=ch[x][!k];
	fa[x]=z; if(nrt(y)) ch[z][chk(y)]=x;
	fa[y]=x; ch[x][!k]=y;
	if(s)fa[s]=y; ch[y][k]=s; up(y),up(x);
}
void splay(int x){
	if(!x)return;
	downall(x);
	while(nrt(x)){
		int y=fa[x];
		if(nrt(y))rot(chk(x)==chk(y)?y:x);
		rot(x);
	}
}
int findL(int x){
	down(x);
	while(ls(x))down(x=ls(x));
	return splay(x),x;
}

int st[maxn],tp;

void ins(int x,int y){
//	cout<<"ins "<<x<<" "<<y<<"\n";
	
	y=findL(y);
	int a,b;
//	T::split(T::rt[x],y,a,b);
//	T::v[y]=T::s[y]=[y]; // wrong.

	node tmp;
	tmp.s0=s[y].s0;
	int z=y;
	For(i,0,3){
		tmp.s[i]=tmp.s[i]+v[z].s[0];
		For(j,0,2-i) tmp.s[i+j+1]=tmp.s[i+j+1]+T::s[T::rt[z]].s[j];
		if(i==3 || !rs(z))break;
		z=findL(rs(z)),splay(z);
	}
	
//	cout<<"tmp:\n";
//	For(i,0,3)cout<<tmp.s[i].s<<" ";puts("");
	
	splay(y);
	T::v[y]=T::s[y]=tmp;
	T::tag[y]=T::tag2[y]=oper();
	
	T::ins(T::rt[x],y);
//	T::rt[x]=T::merge(T::merge(a,y),b);
}
void del(int x,int y){
//	cout<<"del "<<x<<" "<<y<<"\n";
	y=findL(y),splay(y);
	
	T::del(T::rt[x],y);
	oper tmp=T::tag2[y];
//	For(i,0,3) cout<<tmp.t[i]<<" "; cout<<"val_y\n";
	
	oper tt; tt.t0=tmp.t0;
	pt(y,tt); tt.t0=0;
	
	int z=y;
	For(i,0,3){
		For(j,0,3-i) tt.t[j]=tmp.t[i+j];
		T::pt(T::rt[z],mov(tt));
		//v[z]
		
	//	oper tt0; tt0.t[0]=tmp.t[i];
		update(z,tmp.t[i]);
		
		up(z);
		if(i==3 || !rs(z))break;
		z=findL(rs(z)),splay(z);
	}
	
	splay(y);
}
void make(int x,int y){
//	cout<<"mak "<<x<<" "<<y<<"\n";
    if(rs(x)){
    	int tmp=rs(x); rs(x)=0;
    	ins(x,tmp);
    }
    splay(y);
  //  cout<<"mk "<<x<<" "<<y<<"\n";
    if(y){
    	del(x,y);
    	splay(y);
    }
    rs(x)=y;
    up(x);
}
void acc(int x){
//	cout<<"acc "<<x<<"\n";
    tp=0;
    for(int y=0;x;x=fa[y=x]) splay(x),st[++tp]=x;
 //   For(i,1,tp) cout<<st[i]<<" "; cout<<"\n";
    Rep(i,tp,1){
        splay(st[i]);
        make(st[i],st[i-1]);
    }
 //   cout<<"done\n";
}
void mkrt(int x){acc(x),splay(x),pr(x);}
void split(int x,int y){
	mkrt(x),acc(y),splay(y);
}

void dfs(int u){
	if(!u)return;
	down(u);
	if(ls(u))dfs(ls(u));
	cout<<u<<" ";
	if(rs(u))dfs(rs(u));
}

vi e[maxn];
void dfs(int u,int pa){
	for(int v:e[u])
		if(v!=pa){
			fa[v]=u;
			dfs(v,u),ins(u,v);
		}
	up(u);
}
int m;
signed main()
{
//	freopen("3.in","r",stdin);
//	freopen("my.out","w",stdout);
	n=read(),m=read();
	For(i,2,n){
		int u=read(),v=read();
		e[u].pb(v),e[v].pb(u);
	}
	For(i,1,n)T::rnd[i]=rng(),v[i].s0.c=v[i].s[0].c=1;
	dfs(1,0);
	
//	For(i,1,n)cout<<fa[i]<<" ";cout<<" fa\n";
	For(_,1,m){
		int op=read(),u,v,k,x;
		if(op==1){
			u=read(),v=read(),k=read(),x=read();
			oper t;
			For(i,0,k) t.t[i]=x;
			split(u,v);
	//		dfs(v);cout<<" ---\n";
		//	cout<<"pushtag "<<(t.emp())<<"\n";
			pt(v,t);
		}
		if(op==2){
			u=read(),x=read();
			mkrt(1);
			acc(u),splay(u);
			oper t; t.t0=x;
			update(u,x);
			T::pt(T::rt[u],t);
			up(u);
		}
		if(op==3){
			u=read(),v=read(),k=read();
			split(u,v);
			ull res=0;
			For(i,0,k)res+=s[v].s[i].s;
			cout<<res<<"\n";
		}
		if(op==4){
			u=read();
			mkrt(1);
			acc(u),splay(u);
			ull res=0;
			res+=::v[u].s[0].s;
			res+=T::s[T::rt[u]].s0.s;
			cout<<res<<"\n";
		}
		
//		For(i,1,n){
//			cout<<"ASK "<<i<<"\n";
//			split(i,i);
//			cout<<"i: "<<i<<" "<<::v[i].s0.s<<" "<<::v[i].s0.c<<" "<<s[i].s0.s<<" "<<s[i].s0.c<<"\n";
//		}
//		cout<<"\n";
	}
	return 0;
}
/*
8 6
1 2
1 3
2 4
2 5
2 8
4 6
4 7

1 6 8 0 1
1 6 8 1 1
*/