#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

namespace fastIO{ 
	#define BUF_SIZE 1000000 
	#define OUT_SIZE 1000000 
	#define ll long long 
	//fread->read 
	bool IOerror=0; 
	inline char nc(){ 
		static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE; 
		if (p1==pend){ 
			p1=buf; pend=buf+fread(buf,1,BUF_SIZE,stdin); 
			if (pend==p1){IOerror=1;return -1;} 
			//{printf("IO error!\n");system("pause");for (;;);exit(0);} 
		} 
		return *p1++; 
	} 
	inline bool blank(char ch){return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';} 
	inline void read(int &x){ 
		bool sign=0; char ch=nc(); x=0; 
		for (;blank(ch);ch=nc()); 
		if (IOerror)return; 
		if (ch=='-')sign=1,ch=nc(); 
		for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0'; 
		if (sign)x=-x; 
	} 
	inline void read(ll &x){ 
		bool sign=0; char ch=nc(); x=0; 
		for (;blank(ch);ch=nc()); 
		if (IOerror)return; 
		if (ch=='-')sign=1,ch=nc(); 
		for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0'; 
		if (sign)x=-x; 
	} 
	inline void read(double &x){ 
		bool sign=0; char ch=nc(); x=0; 
		for (;blank(ch);ch=nc()); 
		if (IOerror)return; 
		if (ch=='-')sign=1,ch=nc(); 
		for (;ch>='0'&&ch<='9';ch=nc())x=x*10+ch-'0'; 
		if (ch=='.'){ 
			double tmp=1; ch=nc(); 
			for (;ch>='0'&&ch<='9';ch=nc())tmp/=10.0,x+=tmp*(ch-'0'); 
		} 
		if (sign)x=-x; 
	} 
	inline void read(char *s){ 
		char ch=nc(); 
		for (;blank(ch);ch=nc()); 
		if (IOerror)return; 
		for (;!blank(ch)&&!IOerror;ch=nc())*s++=ch; 
		*s=0; 
	} 
	inline void read(char &c){ 
		for (c=nc();blank(c);c=nc()); 
		if (IOerror){c=-1;return;} 
	} 
	//getchar->read 
	inline void read1(int &x){ 
		char ch;int bo=0;x=0; 
		for (ch=getchar();ch<'0'||ch>'9';ch=getchar())if (ch=='-')bo=1; 
		for (;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar()); 
		if (bo)x=-x; 
	} 
	inline void read1(ll &x){ 
		char ch;int bo=0;x=0; 
		for (ch=getchar();ch<'0'||ch>'9';ch=getchar())if (ch=='-')bo=1; 
		for (;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar()); 
		if (bo)x=-x; 
	} 
	inline void read1(double &x){ 
		char ch;int bo=0;x=0; 
		for (ch=getchar();ch<'0'||ch>'9';ch=getchar())if (ch=='-')bo=1; 
		for (;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar()); 
		if (ch=='.'){ 
			double tmp=1; 
			for (ch=getchar();ch>='0'&&ch<='9';tmp/=10.0,x+=tmp*(ch-'0'),ch=getchar()); 
		} 
		if (bo)x=-x; 
	} 
	inline void read1(char *s){ 
		char ch=getchar(); 
		for (;blank(ch);ch=getchar()); 
		for (;!blank(ch);ch=getchar())*s++=ch; 
		*s=0; 
	} 
	inline void read1(char &c){for (c=getchar();blank(c);c=getchar());} 
	//scanf->read 
	inline void read2(int &x){scanf("%d",&x);} 
	inline void read2(ll &x){ 
		#ifdef _WIN32 
			scanf("%I64d",&x); 
		#else 
		#ifdef __linux 
			scanf("%lld",&x); 
		#else 
			puts("error:can't recognize the system!"); 
		#endif 
		#endif 
	} 
	inline void read2(double &x){scanf("%lf",&x);} 
	inline void read2(char *s){scanf("%s",s);} 
	inline void read2(char &c){scanf(" %c",&c);} 
	//inline void readln2(char *s){gets(s);} 
	//fwrite->write 
	struct Ostream_fwrite{ 
		char *buf,*p1,*pend; 
		Ostream_fwrite(){buf=new char[BUF_SIZE];p1=buf;pend=buf+BUF_SIZE;} 
		void out(char ch){ 
			if (p1==pend){ 
				fwrite(buf,1,BUF_SIZE,stdout);p1=buf; 
			} 
			*p1++=ch; 
		} 
		void print(int x){ 
			static char s[15],*s1;s1=s; 
			if (!x)*s1++='0';if (x<0)out('-'),x=-x; 
			while(x)*s1++=x%10+'0',x/=10; 
			while(s1--!=s)out(*s1); 
		} 
		void println(int x){ 
			static char s[15],*s1;s1=s; 
			if (!x)*s1++='0';if (x<0)out('-'),x=-x; 
			while(x)*s1++=x%10+'0',x/=10; 
			while(s1--!=s)out(*s1); out('\n'); 
		} 
		void print(ll x){ 
			static char s[25],*s1;s1=s; 
			if (!x)*s1++='0';if (x<0)out('-'),x=-x; 
			while(x)*s1++=x%10+'0',x/=10; 
			while(s1--!=s)out(*s1); 
		} 
		void println(ll x){ 
			static char s[25],*s1;s1=s; 
			if (!x)*s1++='0';if (x<0)out('-'),x=-x; 
			while(x)*s1++=x%10+'0',x/=10; 
			while(s1--!=s)out(*s1); out('\n'); 
		} 
		void print(double x,int y){ 
			static ll mul[]={1,10,100,1000,10000,100000,1000000,10000000,100000000, 
				1000000000,10000000000LL,100000000000LL,1000000000000LL,10000000000000LL, 
				100000000000000LL,1000000000000000LL,10000000000000000LL,100000000000000000LL}; 
			if (x<-1e-12)out('-'),x=-x;x*=mul[y]; 
			ll x1=(ll)floor(x); if (x-floor(x)>=0.5)++x1; 
			ll x2=x1/mul[y],x3=x1-x2*mul[y]; print(x2); 
			if (y>0){out('.'); for (size_t i=1;i<y&&x3*mul[i]<mul[y];++i) out('0'); print(x3);} 
		} 
		void println(double x,int y){print(x,y);out('\n');} 
		void print(char *s){while (*s)out(*s++);} 
		void println(char *s){while (*s)out(*s++);out('\n');} 
		void flush(){if (p1!=buf){fwrite(buf,1,p1-buf,stdout);p1=buf;}} 
		~Ostream_fwrite(){flush();} 
	}Ostream; 
	inline void print(int x){Ostream.print(x);} 
	inline void println(int x){Ostream.println(x);} 
	inline void print(char x){Ostream.out(x);} 
	inline void println(char x){Ostream.out(x);Ostream.out('\n');} 
	inline void print(ll x){Ostream.print(x);} 
	inline void println(ll x){Ostream.println(x);} 
	inline void print(double x,int y){Ostream.print(x,y);} 
	inline void println(double x,int y){Ostream.println(x,y);} 
	inline void print(char *s){Ostream.print(s);} 
	inline void println(char *s){Ostream.println(s);} 
	inline void println(){Ostream.out('\n');} 
	inline void flush(){Ostream.flush();} 
	//puts->write 
	char Out[OUT_SIZE],*o=Out; 
	inline void print1(int x){ 
		static char buf[15]; 
		char *p1=buf;if (!x)*p1++='0';if (x<0)*o++='-',x=-x; 
		while(x)*p1++=x%10+'0',x/=10; 
		while(p1--!=buf)*o++=*p1; 
	} 
	inline void println1(int x){print1(x);*o++='\n';} 
	inline void print1(ll x){ 
		static char buf[25]; 
		char *p1=buf;if (!x)*p1++='0';if (x<0)*o++='-',x=-x; 
		while(x)*p1++=x%10+'0',x/=10; 
		while(p1--!=buf)*o++=*p1; 
	} 
	inline void println1(ll x){print1(x);*o++='\n';} 
	inline void print1(char c){*o++=c;} 
	inline void println1(char c){*o++=c;*o++='\n';} 
	inline void print1(char *s){while (*s)*o++=*s++;} 
	inline void println1(char *s){print1(s);*o++='\n';} 
	inline void println1(){*o++='\n';} 
	inline void flush1(){if (o!=Out){if (*(o-1)=='\n')*--o=0;puts(Out);}} 
	struct puts_write{ 
		~puts_write(){flush1();} 
	}_puts; 
	inline void print2(int x){printf("%d",x);} 
	inline void println2(int x){printf("%d\n",x);} 
	inline void print2(char x){printf("%c",x);} 
	inline void println2(char x){printf("%c\n",x);} 
	inline void print2(ll x){ 
		#ifdef _WIN32 
			printf("%I64d",x); 
		#else 
		#ifdef __linux 
			printf("%lld",x); 
		#else 
			puts("error:can't recognize the system!"); 
		#endif 
		#endif 
	} 
	inline void println2(ll x){print2(x);printf("\n");} 
	inline void println2(){printf("\n");} 
	#undef ll 
	#undef OUT_SIZE 
	#undef BUF_SIZE 
}; 
using namespace fastIO; 


const int N=201000;
vector<array<int,2>> e[N];
int wt[N];

int q[N],f[N],vis[N],sz[N],ms[N];
int find(int u) {
	int t=1;q[0]=u;f[u]=-1;
	rep(i,0,t) {
		u=q[i];
		rep(j,0,e[u].size()) {
			int v=e[u][j][0];
			if (!vis[v]&&v!=f[u]) f[q[t++]=v]=u;
		}
		ms[q[i]]=0;
		sz[q[i]]=1;
	}
	for (int i=t-1;i>=0;i--) {
		ms[q[i]]=max(ms[q[i]],t-sz[q[i]]);
		if (ms[q[i]]*2<=t) return q[i];
		sz[f[q[i]]]+=sz[q[i]];
		ms[f[q[i]]]=max(ms[f[q[i]]],sz[q[i]]);
	}
	return 0;
}

int M=15;

struct dst {
	vector<ll> val;
	vector<ll> ordval;
	int n,len;
	VI be,cnt;
	vector<ll> mx,mn,tag;

	void init(vector<ll> dp) {
		val=dp;
		ordval=dp;
		n=SZ(dp);
		len=sqrt(n)+0.1;
		be.resize(n);
		mx=vector<ll>(n/len+1,-(1ll<<60));
		mn=vector<ll>(n/len+1,(1ll<<60));
		tag=vector<ll>(n/len+1,0);
		cnt=vector<int>(n/len+1,0);
		rep(i,0,n) {
			be[i]=i/len;
			mx[be[i]]=max(mx[be[i]],val[i]);
			mn[be[i]]=min(mn[be[i]],val[i]);
		}
	}

	#define le(i) (i * len)
	#define re(i) (i * len + len - 1)
	void add(int l,int r,ll c) {
		int lim = min(r, re(be[l]));
		cnt[be[l]]=0;
		for (int i = l; i <= lim; ++ i) {
			val[i] += c;
			mx[be[l]] = max(mx[be[l]], val[i]);
			mn[be[l]] = min(mn[be[l]], val[i]);
		}
		if (be[l] == be[r])	return;
		cnt[be[r]]=0;
		for (int i = le(be[r]); i <= r; ++ i) {
			val[i] += c;
			mx[be[r]] = max(mx[be[r]], val[i]);
			mn[be[r]] = min(mn[be[r]], val[i]);
		}
		for (int i = be[l] + 1; i <= be[r] - 1; ++ i) {
			tag[i] += c;
		}
	}
	int query(int l, int r, ll c) {
		++c;
		int ans = 0, lim = min(r, re(be[l]));
		for (int i = l; i <= lim; ++ i) {
			if (mn[be[l]] + tag[be[l]] >= c) {
				break ;
			}
			if (mx[be[l]] + tag[be[l]] < c) {
				ans += (lim - l + 1);
				break ;
			}
			(val[i] + tag[be[l]] < c) ? ++ ans : ans;
		}
		if (be[l] == be[r])	return ans;
		for (int i = le(be[r]); i <= r; ++ i) {
			if (mn[be[r]] + tag[be[r]] >= c) {
				break ;
			}
			if (mx[be[r]] + tag[be[r]] < c) {
				ans += (r - le(be[r]) + 1);
				break ;
			}
			(val[i] + tag[be[r]] < c) ?	++ ans : ans;
		}
		for (int i = be[l] + 1; i <= be[r] - 1; ++ i) {
			if (mn[i] + tag[i] >= c) {
				continue ;
			}
			if (mx[i] + tag[i] < c) {
				ans += len;
				continue ;
			}
			cnt[i]++;
			if (cnt[i]==M) {
				for (int j = le(i); j <= re(i); ++ j) {
					ordval[j]=val[j];
				}
				sort(ordval.begin()+le(i),ordval.begin()+re(i)+1);
				mx[i]=ordval[re(i)];
				mn[i]=ordval[le(i)];
			}
			if (cnt[i]<M) {
				for (int j = le(i); j <= re(i); ++ j) {
					(val[j] + tag[i] < c) ? ++ ans : ans;
				}
			} else {
				ans+=lower_bound(ordval.begin()+le(i),ordval.begin()+re(i)+1,
					c-tag[i])-(ordval.begin()+le(i));
			}
		}
		return ans;
	}
	ll queryp(int x) {
		return val[x]+tag[be[x]];
	}
}ds[N];
int n,Q;
vector<array<int,3>> ps[N];
vector<array<int,4>> cs[N];

void solve(int x) {
	x=find(x);
	vis[x]=1;
	int tot=0;
	static int l[N],r[N],br[N];
	VI pv;
	vector<ll> dp;
	function<void(int,int,int,ll)> dfs=[&](int u,int f,int b,ll dep) {
		l[u]=tot++;
		dp.pb(dep);
		pv.pb(u);
		br[u]=b;
		for (auto [v,id]:e[u]) if (v!=f&&!vis[v]) {
			dfs(v,u,b==-1?v:b,dep+wt[id]);
			ps[id].pb({x,l[v],r[v]});
		}
		r[u]=tot-1;
	};
	dfs(x,-1,-1,0);
	ds[x].init(dp);
	for (auto u:pv) {
		if (br[u]==-1) {
			cs[u].pb({x,0,tot-1,l[u]});
		} else {
			if (l[br[u]]-1>=0) {
				cs[u].pb({x,0,l[br[u]]-1,l[u]});
			}
			if (r[br[u]]+1<tot) {
				cs[u].pb({x,r[br[u]]+1,tot-1,l[u]});
			}
		}
	}
	for (auto [v,id]:e[x]) if (!vis[v]) {
		solve(v);
	}
}

int main() {
	read(n); read(Q);
	//scanf("%d%d",&n,&Q);
	rep(i,1,n) {
		int u,v,w;
		read(u); read(v); read(w);
		//scanf("%d%d%d",&u,&v,&w);
		e[u].pb({v,i});
		e[v].pb({u,i});
		wt[i]=w;
	}
	solve(1);
	rep(i,0,Q) {
		int op;
		read(op);
		//scanf("%d",&op);
		if (op==1) {
			int id,c;
			read(id); read(c);
			//scanf("%d%d",&id,&c);
			c-=wt[id]; wt[id]+=c;
			for (auto [x,l,r]:ps[id]) {
				ds[x].add(l,r,c);
			}
		} else {
			int x; ll d;
			read(x); read(d);
			//scanf("%d%lld",&x,&d);
			int ans=0;
			for (auto [u,l,r,pos]:cs[x]) {
				ll v=ds[u].queryp(pos);
				ans+=ds[u].query(l,r,d-v);
			}
			println(ans);
			//printf("%d\n",ans);
		}
	}
}