#include <bits/stdc++.h>
using namespace std;

#define for_(i,a,b) for(int i=(a);i<(b);++i)
#define for_rev(i,a,b) for(int i=(a);i>=(b);--i)

typedef long long lint;
typedef pair< int, int > pii;

template< typename DATA >
class SegmentTreeR {
private:
	int size__;
	vector< DATA > data, adds;
	
	inline int left_t(int k) { return (k << 1) + 1; }
	inline int right_t(int k) { return (k << 1) + 2; }
	inline int center(int l, int r) { return (l + r) >> 1; }
	
public:
	SegmentTreeR() {}
	
	SegmentTreeR(int n, DATA ini, DATA lini) {
		for (size__ = 1; size__ < n; size__ <<= 1);
		data.assign(2 * size__ - 1, ini);
		adds.assign(2 * size__ - 1, lini);
	}
	
	void rangeAdd(int a, int b, DATA x) { rangeAdd(a, b, x, 0, 0, size__); }
	
	void rangeAdd(int a, int b, DATA x, int k, int l, int r) {
		if (r <= a || b <= l) return;
		if (a <= l && r <= b) {
			adds[k] += x;
			return;
		}
		
		data[k] += x * (min(r, b) - max(l, a));
		rangeAdd(a, b, x, left_t(k), l, center(l, r));
		rangeAdd(a, b, x, right_t(k), center(l, r), r);
	}
	
	DATA query(int a, int b) { return query(a, b, 0, 0, size__); }
	
	DATA query(int a, int b, int k, int l, int r) {		
		if (r <= a || b <= l) return 0;
		if (a <= l && r <= b) return data[k] + adds[k] * (r - l);
		return  query(a, b, left_t(k), l, center(l, r))
				+ query(a, b, right_t(k), center(l, r), r)
				+ adds[k] * (min(r, b) - max(l, a));
	}
	
	int size() {
		return size__;
	}
};

#define MAX_N 150010
int N, Q;
vector< int > edges[MAX_N];

const int OPN = 0, CLS = 1, NRM = 0, REV = 1;
int depth[MAX_N], parent[MAX_N][30], oc_index[MAX_N][2][2];
	
SegmentTreeR< lint > add_stl, sub_stl;

void makeLCA() {
	memset(oc_index, -1, sizeof(oc_index));
	
	int opn_cnt = 0, cls_cnt = 0;
	stack< pii > st; st.push(pii(0, -1));
	
	while (!st.empty()) {
		pii var = st.top(); st.pop();
		int v = var.first, p = var.second;
		
		if (p < N) {
			parent[v][0] = p;
			depth[v] = (p < 0) ? 0 : depth[p] + 1;
		}
		
		if (oc_index[v][OPN][NRM] < 0) {
			oc_index[v][OPN][NRM] = opn_cnt; ++opn_cnt;
			oc_index[v][OPN][REV] = cls_cnt;
			
			st.push(pii(v, N));
			for (int u : edges[v]) st.push(pii(u, v));
		} else {
			oc_index[v][CLS][NRM] = cls_cnt; ++cls_cnt;
			oc_index[v][CLS][REV] = opn_cnt;
		}
	}
	
	for_(k,0,24) for_(v,0,N) {
		if (parent[v][k] < 0) parent[v][k + 1] = -1;
		else parent[v][k + 1] = parent[ parent[v][k] ][k];
	}
}

int getLCA(int a, int b) {
	if (depth[a] > depth[b]) swap(a, b);
	
	for_(k,0,25) if ((depth[b] - depth[a]) >> k & 1) b = parent[b][k];
	
	if (a == b) return a;
	
	for_rev(k,24,0) {
		if (parent[a][k] != parent[b][k]) {
			a = parent[a][k];
			b = parent[b][k];
		}
	}
	
	return parent[a][0];
}

lint getCost(int v) {
	int A = oc_index[v][OPN][NRM] + 1, S = oc_index[v][OPN][REV];
	return add_stl.query(0, A) - sub_stl.query(0, S);
}

int main() {
	cin >> N >> Q;
		
	for_(i,0,N-1) {
		int a, b;
		scanf("%d %d", &a, &b);
		edges[a].push_back(b);
	}
	
	makeLCA();
	
	add_stl = SegmentTreeR< lint >(N, 0, 0);
	sub_stl = SegmentTreeR< lint >(N, 0, 0);
	
	for_(i,0,Q) {
		int q, a, b;
		scanf("%d %d %d", &q, &a, &b);
		
		if (q) {
			int oL = oc_index[a][OPN][NRM] + 1, oR = oc_index[a][CLS][REV];
			int cL = oc_index[a][OPN][REV], cR = oc_index[a][CLS][NRM];
			
			add_stl.rangeAdd(oL, oR, b);
			sub_stl.rangeAdd(cL, cR, b);
		} else {
			int p = getLCA(a, b);
			printf("%lld\n", getCost(a) + getCost(b) - 2 * getCost(p));
		}
	}
}