#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define maxn 55000
int n, m, q, tr[4*maxn], u[maxn], v[maxn], w[maxn];
void att(int no, int l, int r, int pos, int val) {
if(l > pos || r < pos) return;
else if(l == r) {
tr[no] = val;
}
else {
int f1 = 2*no;
int f2 = 2*no+1;
int mid = (l+r)/2;
att(f1,l,mid,pos,val);
att(f2,mid+1,r,pos,val);
tr[no] = min(tr[f1],tr[f2]);
}
}
int qrr(int no, int l, int r, int L, int R) {
if(l > R || r < L) return inf;
else if(l >= L && r <= R) {
return tr[no];
}
else {
int f1 = 2*no;
int f2 = 2*no+1;
int mid = (l+r)/2;
return min(qrr(f1,l,mid,L,R),qrr(f2,mid+1,r,L,R));
}
}
int qtd, mark[maxn];
vector<int> g[maxn];
void dfs(int x, int w1) {
if(mark[x]) return;
mark[x] = 1;
qtd++;
for(auto id : g[x]) {
int y = u[id]^v[id]^x;
if(w[id] >= w1) dfs(y,w1);
}
}
void solve() {
cin >> n >> m;
for(int i = 1; i <= m; i++) {
cin >> u[i] >> v[i] >> w[i];
g[u[i]].pb(i);
g[v[i]].pb(i);
}
cin >> q;
if(n <= 1000 && m <= 1000 && q <= 10000) {
for(int i = 1; i <= q; i++) {
int op; cin >> op;
if(op == 1) {
int id, val; cin >> id >> val;
w[id] = val;
}
else {
int x, w1; cin >> x >> w1;
qtd = 0;
for(int j = 1; j <= n; j++) {
mark[j] = 0;
}
dfs(x,w1);
cout << qtd << endl;
}
}
}
else {
for(int i = 1; i <= n; i++) {
att(1,1,n-1,i,w[i]);
}
for(int i = 1; i <= q; i++) {
int op; cin >> op;
if(op == 1) {
int id, val; cin >> id >> val;
att(1,1,n-1,id,val);
}
else {
int w1, x; cin >> x >> w1;
int ans = 0;
//busca binaria na seg
int l = 1;
int r = x-1;
int ans1 = 0;
while(l <= r) {
int mid = (l+r)/2;
// cout << v << " " << w1 << " " << mid << " " << qrr(1,1,n-1,1,mid) << endl;
if(qrr(1,1,n-1,mid,x-1) >= w1) {
ans1 = x-mid;
r = mid-1;
}
else
l = mid+1;
}
l = x;
r = n-1;
int ans2 = 0;
while(l <= r) {
int mid = (l+r)/2;
// cout << v << " " << w1 << " " << mid << " " << qrr(1,1,n-1,v,mid) << endl;
if(qrr(1,1,n-1,x,mid) >= w1) {
ans2 = mid-x+1;
l = mid+1;
}
else
r = mid-1;
}
cout << ans1+ans2+1 << endl;
// cout << ans1 << " " << ans2 << endl;
}
}
}
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(0);
// freopen("in.in", "r", stdin);
//freopen("out.out", "w", stdout);
int tt = 1;
// cin >> tt;
while(tt--) solve();
}
