#include<bits/stdc++.h>

using namespace std;
int n,m,Q;
struct edge{
	int u,v;
	int a,b;
}e[200005];
int id[200005];
int last[200005];
int ans[200005];
bool cmpp(int x,int y){
	return (e[x].b<e[y].b);
}
struct bcj{
	int siz;
	int len;
}val[200005];
int fa[200005];
stack<pair<int,bcj>>rc;
int Find(int u){
	return (fa[u]!=u?Find(fa[u]):u);
}
inline void merge(int u,int v){
	u=Find(u),v=Find(v);
	if(val[u].len<val[v].len)swap(u,v);
	if(u!=v){
		fa[v]=u;
		rc.push(make_pair(v,val[u]));
	}
	else rc.push(make_pair(u,val[u]));
	if(u!=v)val[u].siz+=val[v].siz,val[u].len=max(val[v].len+1,val[u].len);
}
inline void del(int u){
	while(rc.size()>u){
		int v=rc.top().first;
		val[fa[v]]=rc.top().second;
		fa[v]=v;
		rc.pop();
	}
}
set<pair<int,int> >hav;
int A[200005],Asiz;
int B[200005],Bsiz;
int main(){
	// freopen("1.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		scanf("%d%d%d",&e[i].u,&e[i].v,&e[i].b);e[i].b=-e[i].b;
		id[i]=i;
	}
	scanf("%d",&Q);
	for(int i=1;i<=m;i++)e[i].a=m+Q+1;
	int sq=0;
	for(int i=1;i<=Q;i++){
		int opt;
		scanf("%d",&opt);
		if(opt==1){
			int u;
			scanf("%d",&u);
			last[i+m]=id[u];
			e[i+m]=e[id[u]];
			e[id[u]].a=i+m-1;
			scanf("%d",&e[i+m].b);e[i+m].b=-e[i+m].b;
			id[u]=i+m;
		}
		else scanf("%d%d",&e[i+m].u,&e[i+m].b),e[i+m].a=-1,e[i+m].b=-e[i+m].b,sq++;
	}
//	for(int i=1;i<=m+Q;i++)cout<<e[i].a<<endl;
	for(int i=1;i<=n;i++)fa[i]=i,val[i].siz=1;
	int siz=sqrt(m+Q);
	for(int i=1;i<=m+Q;i++){
		if(i<=m){
			hav.insert(make_pair(e[i].b,i));
			continue;
		}
		if(e[i].a==-1)B[Bsiz++]=i;
		else {
			A[Asiz++]=i;
			if(Bsiz==0||last[i]<B[0]){
				A[Asiz++]=last[i];
				hav.erase(make_pair(e[last[i]].b,last[i]));
			}
		}
//		cout << B.size()<<endl;
		if(Bsiz>=siz||i==m+Q){
			sort(B,B+Bsiz,cmpp);
			int L=0;
			for(auto j=hav.begin();j!=hav.end();j++){
				while(L<Bsiz&&e[B[L]].b<j->first){
					int now=rc.size();
					for(int k=0;k<Asiz;k++)
						if(A[k]<=B[L]&&e[A[k]].a>=B[L]&&e[A[k]].b<=e[B[L]].b)
							merge(e[A[k]].u,e[A[k]].v);
					int f1=Find(e[B[L]].u);
					ans[B[L]]=val[f1].siz;
					del(now);
					L++;
				}
//				cout <<B[0]<<" "<< e[j->second].a<<endl;
				merge(e[j->second].u,e[j->second].v);
			}
			while(L<Bsiz){
				int now=rc.size();
				for(int k=0;k<Asiz;k++)
					if(A[k]<=B[L]&&e[A[k]].a>=B[L]&&e[A[k]].b<=e[B[L]].b)
						merge(e[A[k]].u,e[A[k]].v);
				int f1=Find(e[B[L]].u);
				ans[B[L]]=val[f1].siz;
				del(now);
				L++;
			}
			del(0);
			for(int j=0;j<Asiz;j++){
				if(e[A[j]].a<=i)continue;
				else hav.insert(make_pair(e[A[j]].b,A[j]));
			}
			Asiz=Bsiz=0;
		}
	}
	for(int i=1;i<=m+Q;i++)
		if(e[i].a==-1)printf("%d\n",ans[i]);
	return 0;
}