#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define pb push_back
#define endl "\n"
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define pb push_back
#define mp make_pair
#define fi first
#define se second
bool z=0;
const int MAXN=2e5;
vector <int> bridge; //int weight [number of bridge];
vector <pair<int,int*>> adj[MAXN +1]; //first to, second.first weight pointer, [from]
int n;
int explora(int v,int w,bool vis[],int cnt){
for(auto &i:adj[v]){
if(vis[i.fi]==0){
if(*i.second<w){
cnt++;
vis[i.fi]=1;
explora(i.first,w,vis,cnt);
}
}
}
return cnt;
}
int main(){
//ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
int t=0,i=0,q=0,v=0,m=0,u=0,d=0,w=0,b=0;cin>>n>>m;
bridge.reserve(m);
for(i=1;i<=m;i++){
cin>>u>>v>>d;
bridge[i]=d;
adj[u].pb(mp(v,&bridge[i]));
adj[v].pb(mp(u,&bridge[i]));
}
//bridge first weight [number of bridge];
//adj first to, second weight [from]
cin>>q;
for(i=0;i<q;i++){
cin>>t;
if(t==1){//weight changes
cin>>b>>w;
bridge[b]=w;
}else if(t==2){
cin>>u>>w;
bool vis[n+1];
t=explora(u,w,vis,0);
cout<<t<<"\n";
}
}
return 0;
}
