#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
vector<vector<pair<int,int>>> neigh;
vector<int> w;
vector<int> visited;
int dfs(int x, int p, int mn){
int s=1;
if(visited[x]) return 0;
visited[x]=true;
for (auto u : neigh[x])
{
if(u.first==p) continue;
if(w[u.second]>=mn) s+=dfs(u.first,x,mn);
}
return s;
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n,m,q; cin >> n >> m;
neigh.resize(n);
w.resize(m);
visited.resize(n);
for (int i = 0; i < m; i++)
{
int u,v; cin >> u >> v >> w[i];
neigh[u-1].push_back({v-1,i});
neigh[v-1].push_back({u-1,i});
}
cin >> q;
for (int i = 0; i < q; i++)
{
int t; cin >> t;
if(t==1){
int b,r; cin >> b >> r;
w[b-1]=r;
}else{
int s,mw; cin >> s >> mw;
cout << dfs(s-1,-1, mw) << "\n";
for (int j = 0; j < n; j++)
{
visited[j]=false;
}
}
}
return 0;
}
