#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int B = 800;
struct Edge {
	int v, nxt;
} e[400005];
int head[200005], len = 1;
void Insert(int u, int v) {
	e[++len] = { v, head[u] };
	head[u] = len;
}
int n, q;
int dpt[200005], lt[200005], rt[200005], cti, st[20][200005], prt[200005];
ll we[200005];
namespace Blk {
	const int B = 500;
	int bel[200005], blt[5005], brt[5005];
	ll tg[5005], a[200005];
	void Init() {
		for (int i = 1; i <= n; i++) {
			bel[i] = (i + B - 1) / B;
			if (!blt[bel[i]]) blt[bel[i]] = i;
			brt[bel[i]] = i;
		}
	}
	void M(int l, int r, ll w) {
		if (bel[l] == bel[r]) {
			for (int i = l; i <= r; i++) a[i] += w;
		}
		else {
			for (int i = bel[l] + 1; i < bel[r]; i++) tg[i] += w;
			for (int i = l; i <= brt[bel[l]]; i++) a[i] += w;
			for (int i = blt[bel[r]]; i <= r; i++) a[i] += w;
		}
	}
	ll Q(int i) { return tg[bel[i]] + a[i]; }
	void Modify(int u, ll w) { M(lt[u], rt[u], w); }
	ll Query(int u) { return Q(lt[u]); }
}
void DFS(int u, int fa) {
	st[0][lt[u] = ++cti] = prt[u] = fa;
	for (int i = head[u]; i; i = e[i].nxt) {
		int v = e[i].v;
		if (v == fa) continue;
		dpt[i >> 1] = v;
		DFS(v, u);
		Blk::Modify(v, we[i >> 1]);
	}
	rt[u] = cti;
}
int PMin(int u, int v) { return lt[u] < lt[v] ? u : v; }
void PreST() {
	for (int j = 1; j < 20; j++) {
		for (int i = 1; i + (1 << j) - 1 <= n; i++) {
			st[j][i] = PMin(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
		}
	}
}
int LCA(int u, int v) {
	if (u == v) return u;
	if ((u = lt[u]) > (v = lt[v])) swap(u, v);
	int x = __lg(v - u++);
	return PMin(st[x][u], st[x][v - (1 << x) + 1]);
}
int ubn[200005], dbn[200005];
vector<int> clu[200005], bn;
namespace TopCluster {
	int ccl[200005], ccnt, st[200005], top;
	void AddCl(int u, int v) {
		if (!v) v = ccl[ccnt];
		for (int i = 1; i <= ccnt; i++) {
			int r = ccl[i];
			ubn[r] = u, dbn[r] = v, clu[v].push_back(r);
		}
		ccnt = 0;
	}
	int wai[200005], rec[200005], ctp[200005];
	void DFS(int u, int fa) {
		ctp[u] = top, wai[u] = 1;
		int bcnt = 0;
		for (int i = head[u]; i; i = e[i].nxt) {
			int v = e[i].v;
			if (v == fa) continue;
			st[++top] = v;
			DFS(v, u);
			wai[u] += wai[v];
			if (rec[v]) rec[u] = rec[v], bcnt++;
		}
		if (wai[u] > B || bcnt > 1 || !fa) {
			wai[u] = 0, rec[u] = u;
			int j = ctp[u] + 1, cnt = 0, cdn = 0;
			for (int i = head[u]; i; i = e[i].nxt) {
				int v = e[i].v;
				if (v == fa) continue;
				if (cnt + wai[v] > B || (rec[v] && cdn)) {
					for (; j < ctp[v] && j <= top; j++) ccl[++ccnt] = st[j];
					AddCl(u, cdn), cdn = cnt = 0;
				}
				cnt += wai[v];
				if (rec[v]) cdn = rec[v];
			}
			for (; j <= top; j++) ccl[++ccnt] = st[j];
			if (u == 1) ccl[++ccnt] = 1;
			AddCl(u, cdn);
			top = ctp[u];
		}
	}
}
ll du[200005], dd[200005];
vector<int> pu[200005], pd[200005];
ll D(int u, int v) {
	return Blk::Query(u) + Blk::Query(v) - 2 * Blk::Query(LCA(u, v));
}
void Modify(int x, ll y) {
	Blk::Modify(dpt[x], y - we[x]);
	we[x] = y;
	int b = dbn[dpt[x]], a = ubn[b];
	for (auto i : clu[b]) {
		du[i] = D(i, a); dd[i] = D(i, b);
	}
	sort(pu[b].begin(), pu[b].end(), [](int x, int y) {
		return du[x] < du[y];
	});
	sort(pd[b].begin(), pd[b].end(), [](int x, int y) {
		return dd[x] < dd[y];
	});
}
int Query(int x, ll y) {
	int ans = 0;
	for (auto u : clu[dbn[x]]) {
		if (D(u, x) <= y) ans++;
	}
	for (auto u : bn) {
		if (u == dbn[x]) continue;
		ll da = D(ubn[u], x), db = D(u, x);
		if (da < db) {
			du[n + 1] = y - da;
			ans += upper_bound(pu[u].begin(), pu[u].end(), n + 1, [](int x, int y) {
				return du[x] < du[y];
			}) - pu[u].begin();
		}
		else {
			dd[n + 1] = y - db;
			ans += upper_bound(pd[u].begin(), pd[u].end(), n + 1, [](int x, int y) {
				return dd[x] < dd[y];
			}) - pd[u].begin();
		}
	}
	return ans;
}
int main() {
	scanf("%d%d", &n, &q);
	Blk::Init();
	for (int i = 1, u, v, w; i < n; i++) {
		scanf("%d%d%d", &u, &v, &w);
		Insert(u, v), Insert(v, u);
		we[i] = w;
	}
	DFS(1, 0), PreST(), TopCluster::DFS(1, 0);
	for (int i = 1; i <= n; i++) {
		bn.push_back(dbn[i]);
		pu[i] = pd[i] = clu[i];
	}
	sort(bn.begin(), bn.end());
	bn.erase(unique(bn.begin(), bn.end()), bn.end());
	for (int x : bn) {
		int b = x, a = ubn[b];
		for (auto i : clu[x]) {
			du[i] = D(i, a); dd[i] = D(i, b);
		}
		sort(pu[b].begin(), pu[b].end(), [](int x, int y) {
			return du[x] < du[y];
		});
		sort(pd[b].begin(), pd[b].end(), [](int x, int y) {
			return dd[x] < dd[y];
		});
	}
	while (q--) {
		int op, x; ll y; scanf("%d%d%lld", &op, &x, &y);
		if (op == 1) Modify(x, y);
		else printf("%d\n", Query(x, y));
	}
	return 0;
}