#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"

template<typename T> inline bool chmax(T &a, T b){if(a<b){a=b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if(a>b){a=b;return true;}return false;}
template<typename T> ostream& operator<<(ostream& s,const complex<T>& d) {return s<<"("<<d.real()<<", "<<d.imag()<< ")";}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const pair<T1,T2>& d) {return s<<"("<<d.first<<", "<<d.second<<")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& d){int len=d.size();rep(i,len){s<<d[i];if(i<len-1) s<<" ";}return s;}
template<typename T> ostream& operator<<(ostream& s,const vector<vector<T>>& d){int len=d.size();rep(i,len){s<<d[i]<<endl;}return s;}
template<typename T> ostream& operator<<(ostream& s,const set<T>& v){s<<"{ ";for(auto itr=v.begin();itr!=v.end();++itr) {if (itr!=v.begin()) {s<< ", ";}s<<(*itr);}s<<" }";return s;}
template<typename T1, typename T2> ostream& operator<<(ostream& s,const map<T1,T2>& m){s<<"{"<<endl;for(auto itr=m.begin();itr!=m.end();++itr){s<<" "<<(*itr).first<<" : "<<(*itr).second<<endl;}s<<"}"<<endl;return s;}

const ll mod=1e9+7;
const ll inf=1e17;
const int INF=1e9;
const double PI=acos(-1);
const double EPS=1e-10;

struct LazySegmentTree{
private:
    int n;
	vector<P> node;
    vector<ll> lazy;
    vector<bool> lazyFlag;
 
public:
    LazySegmentTree(){
        int sz=400050;
        n=1;
		while(n < sz) n*=2;
        node.resize(2*n-1,P(0,0));
        lazy.resize(2*n-1,0);
        lazyFlag.resize(2*n-1,false);
    }
    void lazyEvaluate(int k,int l,int r){
        if(lazyFlag[k]){
            node[k].fi+=lazy[k]*node[k].se;
            if(r-l>1) {
                lazy[k*2+1]+=lazy[k];
                lazy[k*2+2]+=lazy[k];
                lazyFlag[k*2+1]=lazyFlag[k*2+2]=true;
            }
            lazyFlag[k]=false;
            lazy[k]=0;
        }
    }
	void set(int a,P v){
		node[a+n-1]=v;
	}
	void build(){
		for(int i=n-2;i>=0;i--){
			node[i].fi=node[2*i+1].fi+node[2*i+2].fi;
			node[i].se=node[2*i+1].se+node[2*i+2].se;
		}
	}
    void add(int a,int b,ll x,int k=0,int l=0,int r=-1){
        if(r<0) r=n;
        lazyEvaluate(k,l,r);
        if(b<=l || r<=a) return ;
        if(a<=l && r<=b) {
            lazy[k]+=x;
            lazyFlag[k]=true;
            lazyEvaluate(k,l,r);
        }
        else{
            add(a,b,x,2*k+1,l,(l+r)/2);
            add(a,b,x,2*k+2,(l+r)/2,r);
            node[k].fi=node[2*k+1].fi+node[2*k+2].fi;
			node[k].se=node[2*k+1].se+node[2*k+2].se;
        }
    }
 
    P query(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        lazyEvaluate(k, l, r);
        if(b <= l || r <= a) return P(0,0);
        if(a <= l && r <= b) return node[k];
        P vl = query(a, b, 2*k+1, l, (l+r)/2);
        P vr = query(a, b, 2*k+2, (l+r)/2, r);
        return P(vl.fi+vr.fi,vl.se+vr.se);
    }
};

//蟻本p293
/*
verified by
http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=4090869#1
https://atcoder.jp/contests/past201912-open/submissions/9324604
*/
struct LCA{
private:
	vector<vector<int>> v;
	vector<vector<int>> parent;
	vector<int> depth;
	int h = 0;
	void dfs(int n,int m,int d){
		parent[0][n] = m;
		depth[n] = d;
		for(auto x:v[n]){
			if(x!=m) dfs(x,n,d+1);
		}
	}
public:
	LCA(int N,int root,vector<vector<int>>& tree){
		while((1<<h)<=N) h++;
		v = tree;
		parent = vector<vector<int>>(h,vector<int>(N,0));
		depth = vector<int>(N,0);
		dfs(root,-1,0);
		for(int j=0;j+1<h;j++){
			for(int i=0;i<N;i++){
				if(parent[j][i]<0) parent[j+1][i] = -1;
				else parent[j+1][i] = parent[j][parent[j][i]];
			}
		}
	}
	int lca(int n,int m){
		if(depth[n]>depth[m]) swap(n,m);
		for(int j=0;j<h;j++){
			if((depth[m]-depth[n]) >> j&1) m = parent[j][m];
		}
		if(n==m) return n;
		for(int j=h-1;j>=0;j--){
			if(parent[j][n]!=parent[j][m]){
				n = parent[j][n];
				m = parent[j][m];
			}
		}
		return parent[0][n];
	}
	int dep(int n){return depth[n];}
};

int main(){
	cin.tie(0);ios::sync_with_stdio(false);
	int n,q;
	cin>>n>>q;
	vector<vector<int>> g(n);
	rep(i,n-1){
		int a,b;
		cin>>a>>b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	LCA lca(n,0,g);
	LazySegmentTree seg;
	vector<int> ds(n,-1),us(n,2*n+1);
	int t=0;
	auto dfs=[&](auto &dfs,int v,int pre)->void{
		for(auto to:g[v]){
			if(to==pre) continue;
			ds[to]=t++;
			seg.set(ds[to],P(0,1));
			dfs(dfs,to,v);
			us[to]=t++;
			seg.set(us[to],P(0,-1));
		}
	};
	dfs(dfs,0,-1);
	seg.build();
	while(q--){
		int c;
		cin>>c;
		if(c){
			int v,x;
			cin>>v>>x;
			seg.add(ds[v]+1,us[v],x);
		}else{
			int u,v;
			cin>>u>>v;
			int r=lca.lca(u,v);
			cout<<seg.query(ds[r]+1,us[u]).fi+seg.query(ds[r]+1,us[v]).fi<<endl;
		}
	}
}


Measured memory_bytes: 61464