#include<bits/stdc++.h>
#define LL long long
#define mes(s, x) memset(s, x, sizeof s)
#define Maxn 200005
#define mk 3
#define inf 200001
#define pr pair<int, int>
#define vp vector<pr>
#define bmid int mid = (l[i] + r[i]) >> 1
#define lc i << 1
#define rc (i << 1) | 1
#define len(i) (r[i] - l[i] + 1)
using namespace std;
inline LL read(){char c;c = getchar();while(!(('0' <= c && c <= '9') || c == '-')) c = getchar();bool flag = 0;if(c == '-'){flag = 1;c = getchar();}LL tot = 0;while('0' <= c && c <= '9'){tot = 10 * tot + c - '0';c = getchar();}return flag ? -tot : tot;}
vector<int> g[Maxn];
int fa[Maxn], dep[Maxn], siz[Maxn], son[Maxn];
void dfs1(int i){
	siz[i] = 1;
	for(int j: g[i]){
		g[j].erase(find(g[j].begin(), g[j].end(), i));
		fa[j] = i;
		dep[j] = dep[i] + 1;
		dfs1(j);
		siz[i] += siz[j];
		if(siz[j] > siz[son[i]]) son[i] = j;
	}
}
int dfn[Maxn], cnt, top[Maxn];
void mark(int i, int k){
	if(!k){
		if(!dfn[i]) dfn[i] = ++cnt;
		return;
	}
	for(int j: g[i]) mark(j, k - 1);
}
void dfs2(int i){
	vector<int> l;
	for(int j = i; j; j = son[j]){
		top[j] = i;
		l.push_back(j);
	}
	for(int k = 0; k <= mk; k++){
		for(int j: l){
			mark(j, k);
		}
	}
	for(int j: l){
		for(int k: g[j]){
			if(k != son[j]) dfs2(k);
		}
	}
}
vp sub[Maxn], ksub[mk + 1][Maxn], kb[mk + 1][Maxn], kup[mk + 1][Maxn], fd[mk + 1][Maxn];
void up(vp &a){
	sort(a.begin(), a.end());
	vp b;
	for(pr i: a){
		if(b.size() && i.first <= b.back().second + 1) b.back().second = max(b.back().second, i.second);
		else b.push_back(i);
	}
	swap(a, b);
}
void link(vp &a, vp b){
	for(pr i: b) a.push_back(i);
	up(a);
}
vp del(vp a, vp b){
	b.push_back({inf, inf});
	vp c;
	for(int i = 0, j = 0; i < a.size();){
		if(b[j].second < a[i].first) j++;
		else if(b[j].first <= a[i].first){
			if(a[i].second <= b[j].second) i++;
			else{
				a[i].first = b[j].second + 1;
				j++;
			}
		}else if(a[i].second < b[j].first){
			c.push_back({a[i].first, a[i].second});
			i++;
		}else{
			c.push_back({a[i].first, b[j].first - 1});
			if(a[i].second <= b[j].second) i++;
			else{
				a[i].first = b[j].second + 1;
				j++;
			}
		}
	}
	return c;
}
void dfs3(int i){
	sub[i].push_back({dfn[i], dfn[i]});
	ksub[0][i].push_back({dfn[i], dfn[i]});
	for(int j: g[i]){
		dfs3(j);
		link(sub[i], sub[j]);
		for(int k = 0; k <= mk; k++) kb[k][j] = ksub[k][i];
		for(int k = 1; k <= mk; k++) link(ksub[k][i], ksub[k - 1][j]);
	}
	vp suf[mk + 1];
	int x;
	if(g[i].size() > 1){
		for(int j = g[i].size() - 1; j >= 0; j--){
			x = g[i][j];
			for(int k = 1; k <= mk; k++) link(kb[k][x], suf[k]);
			for(int k = 1; k <= mk; k++) link(suf[k], ksub[k - 1][x]);
		}
	}
}
void dfs4(int i){
	for(int k = 0; k <= mk; k++) link(kup[k][i], ksub[k][i]);
	if(son[i]){
		for(int k = 0; k <= mk; k++) kup[k][son[i]] = kup[k][i];
	}
	int x;
	for(int k = 0; k <= mk; k++){
		for(int j = 0; j <= k; j++){
			link(fd[k][i], ksub[j][i]);
		}
		x = i;
		for(int j = k - 1; j >= 0 && fa[x]; j--){
			for(int o = 0; o <= j; o++) link(fd[k][i], kb[o][x]);
			x = fa[x];
		}
	}
	for(int j: g[i]) dfs4(j);
}
struct segtree{
	int l[4 * Maxn], r[4 * Maxn];
	LL s[4 * Maxn], x[4 * Maxn], lz[4 * Maxn];
	void build(int i, int L, int R){
		l[i] = L, r[i] = R;
		if(L == R) return;
		bmid;
		build(lc, L, mid);
		build(rc, mid + 1, R);
	}
	void push_up(int i){
		s[i] = s[lc] + s[rc];
		x[i] = max(x[lc], x[rc]);
	}
	void add0(int i, int k){
		s[i] += len(i) * k;
		x[i] += k;
		lz[i] += k;
	}
	void push_down(int i){
		if(lz[i]){
			add0(lc, lz[i]);
			add0(rc, lz[i]);
			lz[i] = 0;
		}
	}
	void add(int i, int L, int R, int k){
		if(R < l[i] || r[i] < L) return;
		if(L <= l[i] && r[i] <= R){
			add0(i, k);
			return;
		}
		push_down(i);
		add(lc, L, R, k);
		add(rc, L, R, k);
		push_up(i);
	}
	LL tot(int i, int L, int R){
		if(R < l[i] || r[i] < L) return 0;
		if(L <= l[i] && r[i] <= R) return s[i];
		push_down(i);
		return tot(lc, L, R) + tot(rc, L, R);
	}
	LL solve(int i, int L, int R){
		if(R < l[i] || r[i] < L) return -1e18;
		if(L <= l[i] && r[i] <= R) return x[i];
		push_down(i);
		return max(solve(lc, L, R), solve(rc, L, R));
	}
} t;
vp get(int u, int v, int k){
	vp a;
	while(top[u] != top[v]){
		if(dep[top[u]] < dep[top[v]]) swap(u, v);
		link(a, kup[k][u]);
		u = fa[top[u]];
	}
	if(dep[u] < dep[v]) swap(u, v);
	link(a, del(kup[k][u], kup[k][v]));
	link(a, fd[k][v]);
	return a;
}
int main(){
	#ifndef ONLINE_JUDGE
		freopen("in", "r", stdin);
		freopen("out", "w", stdout);
	#endif
	int n = read(), m = read(), tp, u, v, k, x;
	for(int i = 1; i < n; i++){
		u = read(), v = read();
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs1(1);
	dfs2(1);
	dfs3(1);
	dfs4(1);
	vp r;
	LL ans;
	t.build(1, 1, n);
	for(int i = 1; i <= m; i++){
		tp = read();
		if(tp % 2){
			u = read(), v = read(), k = read();
			r = get(u, v, k);
		}else{
			u = read();
			r = sub[u];
		}
		if(tp <= 2) x = read();
		else if(tp <= 4) ans = 0;
		else ans = -1e18;
		for(pr j: r){
			if(tp <= 2) t.add(1, j.first, j.second, x);
			else if(tp <= 4) ans += t.tot(1, j.first, j.second);
			else ans = max(ans, t.solve(1, j.first, j.second));
		}
		if(tp > 2) printf("%lld\n", ans);
	}
    return 0;
}