#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
struct dsu{
stack<tuple<int, int, int>> st;
int n;
vector<int> id;
vector<vector<int>> comp;
dsu(int nn){
n = nn;
for(int i = 0; i < n; i++) id.pb(i), comp.pb({i});
}
int unite(int a, int b){
a = id[a], b = id[b];
if(a == b) return 0;
if(comp[a].size() > comp[b].size()) swap(a, b);
st.push({a, b, (int)comp[a].size()});
while(!comp[a].empty()){
int x = comp[a].back(); comp[a].pop_back();
id[x] = b;
comp[b].pb(x);
}
return 1;
}
void rollback(){
auto [a, b, sz] = st.top(); st.pop();
while(sz--){
int x = comp[b].back(); comp[b].pop_back();
id[x] = a;
comp[a].pb(x);
}
}
};
int sq;
bool comp(tuple<ll, int, int, vector<pair<int, int>>> a, tuple<ll, int, int, vector<pair<int, int>>> b){return get<0>(a) > get<0>(b);}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m; cin >> n >> m;
vector<tuple<ll, int, int>> edge;
for(int i = 0; i < m; i++){
int a, b; ll w; cin >> a >> b >> w; a--, b--;
edge.pb({w, a, b});
}
int q; cin >> q;
sq = sqrt(q+0.0);
vector<vector<tuple<ll, int, int, int>>> query;
query.pb({});
int inx = 0;
for(int i = 0; i < q; i++){
int tt, s; ll w; cin >> tt >> s >> w; s--;
int in = -1;
if(tt == 2) in = inx++;
if(query.back().size() >= sq) query.pb({});
query.back().pb({tt, s, w, in});
}
vector<int> ans(inx);
for(auto qq: query){
dsu ds(n);
vector<tuple<ll, int, int, vector<pair<int, int>>>> calc;
vector<bool> ucng(m, 1);
vector<tuple<ll, int, int>> edges;
vector<tuple<int, ll, int, int>> cng;
for(auto [tt, s, w, in]: qq) if(tt == 1) ucng[s] = 0;
for(int i = 0; i < m; i++){
if(ucng[i]) edges.pb(edge[i]);
else cng.pb({i, get<0>(edge[i]), get<1>(edge[i]), get<2>(edge[i])});
}
map<int, int> mp;
for(int i = 0; i < cng.size(); i++) mp[get<0>(cng[i])] = i;
for(auto [tt, s, w, in]: qq){
if(tt == 1){
auto &[ss, ww, a, b] = cng[mp[s]];
ww = w;
}
else{
vector<pair<int, int>> upd;
for(auto [inn, ww, a, b]: cng) if(ww >= w) upd.pb({a, b});
calc.pb({w, s, in, upd});
}
}
sort(edges.begin(), edges.end());
sort(calc.begin(), calc.end(), comp);
for(auto [w, s, in, upd]: calc){
while(!edges.empty() && get<0>(edges.back()) >= w){
auto [ww, a, b] = edges.back(); edges.pop_back();
ds.unite(a, b);
}
int k = 0;
for(auto [a, b]: upd) k+=ds.unite(a, b);
ans[in] = ds.comp[ds.id[s]].size();
while(k--) ds.rollback();
}
for(auto [tt, s, w, in]: qq) if(tt == 1){
get<0>(edge[s]) = w;
}
}
for(int x: ans) cout << x << "\n";
}
