#include<bits/stdc++.h>
/*
#pragma optimize ("g",on)
#pragma GCC optimize("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
*/
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
const int inf = 1e9, N = 2e5 + 1, mod = 1e9 + 7;
vector<pii> dd = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
main() {
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int n, m;
cin >> n >> m;
int u[m + 1], v[m + 1], dd[m + 1];
for (int i = 1; i <= m; i++) {
cin >> u[i] >> v[i] >> dd[i];
}
int q;
cin >> q;
while (q--) {
int t;
cin >> t;
if (t == 1) {
int i, r;
cin >> i >> r;
dd[i] = r;
}else {
int p, w;
cin >> p >> w;
vector<pii> adj[n + 1];
for (int i = 1; i <= m; i++) {
adj[u[i]].pb({v[i], dd[i]});
adj[v[i]].pb({u[i], dd[i]});
}
set<pii> s;
vector<int> d(n + 1, -inf);
d[p] = inf;
s.insert({inf, p});
while (!s.empty()) {
int u = (*s.begin()).ss;
s.erase(s.begin());
for (auto e: adj[u]) {
if (d[e.ff] < min(d[u], e.ss)) {
d[e.ff] = min(d[u], e.ss);
s.insert({d[e.ff], e.ff});
}
}
}
int ans = 0;
for (int i = 1; i <= n; i++) if (d[i] >= w) ans++;
cout << ans << nl;
}
}
}
