//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }
#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'
const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;
void SetIO(string str = "") {
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
else {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
void FastIO() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int N = 3e5 + 10, M = 1e7 + 10;
mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % mod;
}
b >>= 1;
a = (a * a) % mod;
}
return res;
}
ll n, m, q, sz[N], par[N], mn[N], tin[N], tout[N], timer;
vector<pair<int, ll>> adj[N];
void dfs0(int node) {
mn[node] = inf;
sz[node] = 1;
tin[node] = ++timer;
for (auto [u, w] : adj[node]) {
dfs0(u);
sz[node] += sz[u];
mn[node] = min(mn[node], mn[u]);
}
for (auto [u, w] : adj[node]) {
mn[node] = min(mn[node], w);
}
tout[node] = timer;
}
bool herna(int u, int v) {
return tin[u] <= tin[v] && tout[u] >= tout[v];
}
void upd(int node, int v, ll w, int x) {
if (x == node) {
for (auto& [u, W] : adj[node]) {
if (u == v) {
W = w;
break;
}
}
mn[node] = inf;
for (auto [u, W] : adj[node]) {
mn[node] = min(mn[node], mn[u]);
}
for (auto [u, W] : adj[node]) {
mn[node] = min(mn[node], W);
}
return;
}
assert(adj[x].size() > 0);
int L = adj[x][0].first, R = adj[x][1].first;
if (herna(L, node)) {
upd(node, v, w, L);
}
else {
upd(node, v, w, R);
}
mn[x] = inf;
for (auto [u, W] : adj[x]) {
mn[x] = min(mn[x], mn[u]);
}
for (auto [u, W] : adj[x]) {
mn[x] = min(mn[x], W);
}
}
ll qry(int node, ll w, int x) {
if (mn[x] >= w) {
return sz[x];
}
if (herna(node, x)) {
ll ans = 0;
for (auto [u, W] : adj[x]) {
if (W >= w) {
ans += qry(node, w, u);
}
}
return ans;
}
assert(adj[x].size() > 0);
int L = adj[x][0].first, R = adj[x][1].first;
if (herna(L, node)) {
return qry(node, w, L);
}
else {
return qry(node, w, R);
}
return -1;
}
void solve(int tc) {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
ll w;
cin >> u >> v >> w;
adj[u].push_back({ v, w });
par[v] = u;
}
dfs0(1);
while (q--) {
int type;
cin >> type;
if (type == 1) {
int i;
ll w;
cin >> i >> w;
int u = (i + 1) / 2;
int v = i + 1;
upd(u, v, w, 1);
}
else {
int node;
ll w;
cin >> node >> w;
cout << qry(node, w, 1) << endl;
}
}
}
void precalc() {
}
int main() {
// SetIO("teamwork");
FastIO();
int test_case = 1;
// cin >> test_case;
precalc();
int cnt = 1;
while (test_case--) {
solve(cnt++);
}
return 0;
}
