#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
namespace IO{//by cyffff
    int len=0;
    char ibuf[(1<<21)+1],*iS,*iT,out[(1<<26)+1];
    #if ONLINE_JUDGE
    #define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
    #else
    #define gh() getchar()
    #endif
    #define reg register
    inline int read(){
        reg char ch=gh();
        reg int x=0;
        reg char t=0;
        while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
        while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
        return t?-x:x;
    }
    inline void putc(char ch){
        out[len++]=ch;
    }
    template<class T>
    inline void write(T x){
        if(x<0)putc('-'),x=-x;
        if(x>9)write(x/10);
        out[len++]=x%10+48;
    }
    inline void flush(){
        fwrite(out,1,len,stdout);
        len=0;
    }
    inline char getc(){
        char ch=gh();
        while(ch<'a'||ch>'z') ch=gh();
        return ch;
    }
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
#define pii pair<int,int>
#define mpr make_pair
#define fir first
#define sec second
#define vi vector<int>
#define vii vector<pii>
const int N=2e5+10,K=3+1;
int n,m,siz[N],fa[N],wm[N],dep[N],dfn[N],tp[N],tim;
vi ed[N],son[N];
vii sub[N],del[N][K],suk[N][K],ack[N][K],alk[N][K];
struct strBIT{
	#define lowbit(i) (i&-i)
	ull t1[N],t2[N];
	inline void add(int x,ull v){
		for(int i=x;i<=n;i+=lowbit(i))
			t1[i]+=v,t2[i]+=x*v;
	}
	inline ull query(int x){
		ull s1=0,s2=0;
		for(int i=x;i;i-=lowbit(i))
			s1+=t1[i],s2+=t2[i];
		return (x+1)*s1-s2; 
	}
	inline void add(int l,int r,int v){
		add(l,v),add(r+1,-v);
	} 
	inline ull query(int l,int r){
		return query(r)-query(l-1);
	}
}T;
inline int LCA(int x,int y){
	while(tp[x]!=tp[y]){
		if(dep[tp[x]]<dep[tp[y]]) swap(x,y);
		x=fa[tp[x]];
	}
	return dep[x]<dep[y]?x:y;
}
inline void merge(vii &x,vii &y){
	int n=x.size(),m=y.size();
	if(!n){ x=y;return ; }
	if(!m) return ;
	for(auto tmp:y)
		x.emplace_back(tmp);
//	vii z;
//	z.resize(n+m);
//	merge(x.begin(),x.begin()+n,y.begin(),y.end(),z.begin());
//	x=z;
}
inline void zip(vii &x){
	if(!x.size()) return ;
	sort(x.begin(),x.end());
	vii y;
	for(auto p:x){
		if(y.size()&&y.back().sec+1==p.fir) y.back().sec=p.sec;
		else y.push_back(p);
	}
	x=y;
}
inline void dfs1(int x,int f){
	fa[x]=f,siz[x]=1,dep[x]=dep[f]+1;
	for(int t:ed[x]){
		if(t==f) continue;
		son[x].push_back(t);
		dfs1(t,x);
		if(siz[t]>siz[wm[x]]) wm[x]=t;
		siz[x]+=siz[t];
	}
}
inline void dfs2(int x){
	vi cn,ts;
	for(int i=x;i;i=wm[i])
		cn.push_back(i),tp[i]=x;
	ts=cn;
	for(int i=0;i<K;i++){
		vi nt;
		for(auto u:ts){
			if(!dfn[u]) dfn[u]=++tim;
			for(auto v:son[u])
				nt.push_back(v);
		}
		ts=nt;
	}
	for(int u:cn)
		for(int v:son[u])
			if(v!=wm[u])
				dfs2(v);
}
inline void dfs3(int x){
	sub[x].emplace_back(mpr(dfn[x],dfn[x]));
	suk[x][0].emplace_back(mpr(dfn[x],dfn[x]));
	for(auto t:son[x]){
		dfs3(t);
		for(int i=1;i<K;i++)
			merge(del[t][i],suk[x][i]),
			merge(suk[x][i],suk[t][i-1]),
			zip(suk[x][i]);
		merge(sub[x],sub[t]);
	}
	vii rt[K];
	for(int p=(int)son[x].size()-1;p>=0;p--){
		int t=son[x][p];
		del[t][0].emplace_back(mpr(dfn[x],dfn[x]));
		for(int i=1;i<K;i++)
			merge(del[t][i],rt[i]),
			merge(rt[i],suk[t][i-1]),
			zip(del[t][i]),zip(rt[i]);
	}
	zip(sub[x]);
	for(int i=0;i<K;i++)
		zip(suk[x][i]);
}
inline void dfs4(int x){
	ack[x][0].emplace_back(mpr(dfn[x],dfn[x]));
	for(int i=1;i<K;i++)
		ack[x][i]=suk[x][i],merge(ack[x][i],ack[x][i-1]);
	for(int i=0;i<K;i++)
		ack[x][i]=suk[x][i],merge(ack[x][i],ack[fa[x]][i]),zip(ack[x][i]);
	for(int i=0;i<K;i++){
		alk[x][i]=suk[x][i];
		if(i) merge(alk[x][i],alk[x][i-1]);
		for(int j=1,las=x;j<=i&&las;j++,las=fa[las])
			merge(alk[x][i],del[las][i-j]);
		zip(alk[x][i]);
	}
	for(int t:son[x])
		dfs4(t);
}
inline vii fdp1(int x,int y,int k){
	vii p=ack[x][k],q=ack[y][k];
	int n=p.size(),m=q.size();
	vii t;
	for(int i=0,l=0;i<n;i++){
		int r=l-1;
		while(r+1<m&&q[r+1].sec<=p[i].sec) r++;
		int las=p[i].fir;
		for(int j=l;j<=r;j++){
			if(las<q[j].fir) t.push_back(mpr(las,q[j].fir-1));
			las=q[j].sec+1;
		}
		if(las<=p[i].sec) t.push_back(mpr(las,p[i].sec));
		l=r+1;
	}
	zip(t);
	return t;
}
inline vii fdp2(int x,int y,int k){
	int l=LCA(x,y);
	vii t,p=fdp1(x,l,k),q=fdp1(y,l,k);
	t.push_back(mpr(dfn[l],dfn[l]));
	merge(t,p);
	merge(t,q);
	zip(t);
	return t;
}
int main(){
	n=read(),m=read();
	for(int i=1;i<n;i++){
		int u=read(),v=read();
		ed[u].push_back(v),ed[v].push_back(u);
	}
	dfs1(1,0),dfs2(1),dfs3(1),dfs4(1);
	while(m--){
		int opt=read();
		if(opt==1){
			int u=read(),v=read(),k=read(),w=read();
			vii tmp=fdp2(u,v,k);
			for(auto s:tmp)
				T.add(s.fir,s.sec,w);
		}else if(opt==2){
			int u=read(),v=read();
			for(auto s:sub[u])
				T.add(s.fir,s.sec,v);
		}else if(opt==3){
			int u=read(),v=read(),k=read();
			ull sum=0;
			vii tmp=fdp2(u,v,k);
			for(auto s:tmp)
				sum+=T.query(s.fir,s.sec);
			write(sum),putc('\n');
		}else if(opt==4){
			int u=read();
			ull sum=0;
			for(auto s:sub[u])
				sum+=T.query(s.fir,s.sec);
			write(sum),putc('\n');
		}
	}
	flush();
}