//----------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;
vector<pair<int, ll>> adj[N];
bool visited[N];
struct segtree {
int size = 1;
vector<ll> stree;
void init() {
while (size <= n) size <<= 1;
stree.assign(4 * size, inf);
}
void upd(int i, ll v, int x, int lx, int rx) {
if (rx - lx == 1) {
stree[x] = v;
return;
}
int mid = (lx + rx) / 2;
if (i < mid) upd(i, v, 2 * x + 1, lx, mid);
else upd(i, v, 2 * x + 2, mid, rx);
stree[x] = min(stree[2 * x + 1], stree[2 * x + 2]);
}
ll qry(int l, int r, int x, int lx, int rx) {
if (lx >= r || rx <= l) return inf;
if (lx >= l && rx <= r) return stree[x];
int mid = (lx + rx) / 2;
return min(qry(l, r, 2 * x + 1, lx, mid), qry(l, r, 2 * x + 2, mid, rx));
}
void upd(int i, ll v) {
upd(i, v, 0, 0, size);
}
ll qry(int l, int r) {
return qry(l, r, 0, 0, size);
}
} st;
void solve(int tc) {
cin >> n >> m;
st.init();
vector<tuple<int, int, ll>>edges;
for (int i = 1; i <= m; i++) {
int u, v;
ll w;
cin >> u >> v >> w;
st.upd(u, w);
}
cin >> q;
while (q--) {
int type;
cin >> type;
if (type == 1) {
int i;
ll w;
cin >> i >> w;
st.upd(i, w);
}
else {
int node;
ll w;
cin >> node >> w;
int l = 1, r = node - 1, ans_l = node;
while (l <= r) {
int mid = (l + r) / 2;
if (st.qry(mid, node) >= w) {
r = mid - 1;
ans_l = mid;
}
else {
l = mid + 1;
}
}
l = node, r = n - 1;
int ans_r = node - 1;
while (l <= r) {
int mid = (l + r) / 2;
if (st.qry(node, mid + 1) >= w) {
l = mid + 1;
ans_r = mid;
}else{
r = mid - 1;
}
}
ans_r++;
cout << ans_r - ans_l + 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;
}
