#include<bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
#define BLOCK 300
int n,m,q;
lld edgelist[1000000][3];
lld queries[1000000][3];
lld answers[1000000];
bool permanent[1000000];
lld save[1000000];
vector<int> nei[1000000];
bool visited[1000000];
class DSU{
int parent[1000000];
int size[1000000];
public:
void init(int N){
rep(i,0,N){
parent[i]=i;
size[i]=1;
}
}
int root(int a){
if(parent[a]==a)return a;
parent[a]=root(parent[a]);
return parent[a];
}
void merge(int a, int b){
a=root(a);
b=root(b);
if(a==b)return;
if(size[a]<size[b])swap(a,b);
size[a]+=size[b];
parent[b]=a;
}
int SZ(int node){
return size[root(node)];
}
};
DSU *D;
void process(int l, int r){
//cout<<l<<" "<<r<<endl;
rep(i,0,n)visited[i]=false;
rep(i,0,m){
permanent[i]=true;
save[i]=edgelist[i][2];
}
vector<int> changed;
rep(i,l,r){
if(queries[i][0]==1){
//cout<<queries[i][1]<<endl;
permanent[queries[i][1]]=false;
}
}
vector<pii> V;//edges/weights
rep(i,0,m){
//cout<<permanent[i]<<endl;
if(permanent[i]){
V.push_back(pii(edgelist[i][2],i+1));//peso,numero
}else changed.push_back(i);
}
rep(i,l,r){
if(queries[i][0]==2){
V.push_back(pii(queries[i][2],-i));//peso,tempo da query
}
}
sort(V.begin(),V.end());
reverse(V.begin(),V.end());
D->init(n);
trav(a,V){
//cout<<a.first<<" "<<a.second<<endl;
if(a.second>0){
int num=a.second-1;
D->merge(edgelist[num][0],edgelist[num][1]);
}else{
int time=-a.second;
rep(i,l,time){
if(queries[i][0]==1){
edgelist[queries[i][1]][2]=queries[i][2];
}
}
vector<pii> edges;
trav(b,changed){
if(edgelist[b][2]>=queries[time][2]){
if(D->root(edgelist[b][1])!=D->root(edgelist[b][0])){
edges.push_back(pii(D->root(edgelist[b][1]),D->root(edgelist[b][0])));
}
}
}
trav(e,edges){
nei[e.first].push_back(e.second);
nei[e.second].push_back(e.first);
visited[e.second]=false;
visited[e.first]=false;
}
queue<int> q;
q.push(D->root(queries[time][1]));
visited[D->root(queries[time][1])]=true;
answers[time]=0;
stack<int> s;
while(!q.empty()){
int u=q.front();
q.pop();
answers[time]+=D->SZ(u);
s.push(u);
trav(v,nei[u]){
if(!visited[v]){
visited[v]=true;
q.push(v);
}
}
}
while(!s.empty()){
visited[s.top()]=false;
s.pop();
}
trav(e,edges){
nei[e.first].clear();
nei[e.second].clear();
}
}
}
}
int main(){
D=new DSU();
scanf("%d %d",&n,&m);
rep(i,0,m){
rep(j,0,3){
scanf("%lld",&edgelist[i][j]);
if(j<2)edgelist[i][j]--;
}
}
scanf("%d",&q);
rep(i,0,q){
rep(j,0,3)scanf("%lld",&queries[i][j]);
queries[i][1]--;
}
rep(i,0,q/BLOCK+1){
process(BLOCK*i,min(BLOCK*(i+1),q));
rep(j,BLOCK*i,min(BLOCK*(i+1),q)){
if(queries[j][0]==1){
edgelist[queries[i][1]][2]=queries[i][2];
}
}
}
rep(i,0,q){
if(queries[i][0]==2){
cout<<answers[i]<<endl;
}
}
return 0;
}
