#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 47
#endif
struct SegmentTree {
int n;
vector<int> t;
SegmentTree(int _n) {
n = _n;
t.assign(4 * n, 2e9);
}
void update(int id, int tl, int tr, int i, int v) {
if (tl == tr) {
t[id] = v;
return;
}
int x = (id << 1) + 1, y = x + 1, tm = (tl + tr) >> 1;
if (i <= tm) {
update(x, tl, tm, i, v);
} else {
update(y, tm + 1, tr, i, v);
}
t[id] = min(t[x], t[y]);
}
int get(int id, int tl, int tr, int l, int r) {
if (r < tl || tr < l) return 2e9;
if (l <= tl && tr <= r) return t[id];
int x = (id << 1) + 1, y = x + 1, tm = (tl + tr) >> 1;
return min(get(x, tl, tm, l, r), get(y, tm + 1, tr, l, r));
}
void update(int i, int v) { update(0, 0, n - 1, i, v); }
int get(int l, int r) { return get(0, 0, n - 1, l, r); }
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<array<int, 3>> e;
SegmentTree k(n);
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w;
u--; v--;
e.push_back({u, v, w});
k.update(i, w);
}
int q;
cin >> q;
while (q--) {
int t;
cin >> t;
if (t == 1) {
int b, r;
cin >> b >> r;
b--;
k.update(b, r);
e[b][2] = r;
} else {
int s, w;
cin >> s >> w;
s--;
int res = 1;
if (s != n - 1) {
int l = 0, r = n - s - 1;
while (l + 1 < r) {
int m = (l + r) / 2;
int ret = k.get(s, s + m);
if (k.get(s, s + m) >= w) {
l = m;
} else {
r = m;
}
}
if (k.get(s, s + l) >= w) {
res += l + 1;
}
}
int l = 0, r = s + 1;
while (l + 1 < r) {
int m = (l + r) / 2;
if (k.get(s - m, s) >= w) {
l = m;
} else {
r = m;
}
}
res += l;
cout << res << '\n';
}
}
return 0;
}
