#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=50007,M=100007,S=100;


int U[M],V[M],d[M];
bool is[M];
vector<pair<pair<int,int>,int>>Q,T;
vector<int>W[M];

int ans[M];

int r[N],s[N];
int n,m;

int Find(int v)
{
	while(v!=r[v]) v=r[v];
	return v;
}
vector<pair<int,int>>xd;
void Union(int u,int v)
{
	u=Find(u);
	v=Find(v);
	if(u==v) xd.pb({-1,-1});
	else
	{
		if(s[u]>s[v]) swap(u,v);
		xd.pb({u,v});
		s[v]+=s[u];
		r[u]=v;
	}
}
void Rollback()
{
	int u=xd.back().st,v=xd.back().nd;
	xd.pop_back();
	if(u!=-1)
	{
		r[u]=u;
		s[v]-=s[u];
	}
}
int ile;

void calc()
{
	vector<pair<int,int>>E;
	vector<int>X;
	FOR(i,1,m) 
	{
		if(!is[i]) E.pb({d[i],i});
		else X.pb(i);
		is[i]=0;
	}
	debug(sz(X));
	Q.pb({{1,1},M-1});
	int it=0;
	for(auto [p,i]:Q)
	{
		while(it<sz(T)&&T[it].nd<i)
		{
			d[T[it].st.st]=T[it].st.nd;
			it++;
		}
		for(auto x:X) if(d[x]>=p.st) W[i].pb(x);
	}
	Q.pop_back();
	sort(all(Q),greater<pair<pair<int,int>,int>>());
	sort(all(E),greater<pair<int,int>>());
	FOR(i,1,n)
	{
		r[i]=i;
		s[i]=1;
	}
	it=0;
	for(auto [p,i]:Q)
	{
		while(it<sz(E)&&E[it].st>=p.st) 
		{
			Union(U[E[it].nd],V[E[it].nd]);
			it++;
		}
		debug(i,W[i]);
		for(auto j:W[i]) Union(U[j],V[j]);
		ans[i]=s[Find(p.nd)];
		for(auto j:W[i]) Rollback();
		W[i].clear();
	}
	xd.clear();
	Q.clear();
	T.clear();
	ile=0;
}

signed main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	FOR(i,1,m) cin>>U[i]>>V[i]>>d[i];
	int q;
	cin>>q;
	FOR(i,1,q)
	{
		int t,a,b;
		cin>>t>>a>>b;
		if(t==1)
		{
			is[a]=1;
			ile++;
			T.pb({{a,b},i});
		}
		else Q.pb({{b,a},i});
		if(ile==S) calc();
	}
	calc();
	FOR(i,1,q) if(ans[i]>0) cout<<ans[i]<<endl;
	
	return 0;
}