// In sha2 Allah IOI 2025
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
struct DSU{
vector<int> par;
vector<int> sz;
vector<pair<int,int>> rsz;
vector<int> rpar;
int nn;
DSU(int n){
nn = n;
par.resize(n+1) , sz.resize(n+1,1);
iota(par.begin(),par.end(),0);
}
int getP(int node){
if(node == par[node]) return node;
return getP(par[node]);
}
bool join(int a,int b){
a = getP(a) , b = getP(b);
if(a == b) return 0;
if(sz[a] < sz[b]) swap(a,b);
rsz.push_back({a,sz[a]});
rpar.push_back(b);
par[b] = a;
sz[a] += sz[b];
return 1;
}
void rollback(){
sz[rsz.back().first] = rsz.back().second;
par[rpar.back()] = rpar.back();
rsz.pop_back();
rpar.pop_back();
}
};
void solve(){
int n,m;
cin>>n>>m;
vector<array<int,3>> edges(m);
for(auto &[a,b,c] : edges) cin>>a>>b>>c;
int q;
cin>>q;
vector<array<int,3>> Q(q);
for(auto &[t,a,b] : Q) cin>>t>>a>>b;
vector<int> ans(q,-1);
for(int l=0;l<q;l+=317){
int r = min(q-1,l+316);
vector<bool> changed(m);
vector<pair<int,int>> un;
vector<array<int,3>> ch_ed;
vector<array<int,3>> qs;
for(int i=l;i<=r;i++){
if(Q[i][0] == 1) ch_ed.push_back({i,Q[i][1]-1,Q[i][2]}) , changed[Q[i][1]-1] = 1;
else qs.push_back({Q[i][2],Q[i][1],i});
}
for(int i=0;i<m;i++) if(!changed[i]) un.push_back({edges[i][2],i});
sort(un.rbegin(),un.rend());
sort(qs.rbegin(),qs.rend());
DSU ds(n);
int pt = 0;
for(auto [w,node,idx] : qs){
while(pt < (int)un.size() && un[pt].first >= w) ds.join(edges[un[pt].second][0],edges[un[pt].second][1]) , pt ++;
int cnt = 0;
for(auto [t,e,c] : ch_ed){
if(t > idx && edges[e][2] >= w){
if(ds.join(edges[e][0],edges[e][1])) cnt ++;
}
else if(t < idx && c >= w){
if(ds.join(edges[e][0],edges[e][1])) cnt ++;
}
}
ans[idx] = ds.sz[ds.getP(node)];
while(cnt--) ds.rollback();
}
for(auto [t,e,c] : ch_ed) edges[e][2] = c;
}
for(int i=0;i<q;i++){
if(ans[i] == -1) continue;
cout<<ans[i]<<endl;
}
}
int main(){
// ios_base::sync_with_stdio(0);
// cin.tie(0); cout.tie(0);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
