// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("Ofast,unroll-loops")
/* I don't understand these pragmas at all.
Earlier I added all the optimizations I could find but
upon my short amount of testing, these 2 are enough and adding more makes it slower. */
// -------------------</optimizations>--------------------
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
// ---------------</Headers and namespaces>---------------
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
#define FLSH fflush(stdout)
#define fileIO(name) \
freopen(name".in", "r", stdin); \
freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x);
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// ----------------</Defines and typedefs>----------------
// -------------------<Debugging stuff>-------------------
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
// ------------------</Debugging stuff>-------------------
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
// ------------------------</RNG>-------------------------
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
const int FACSZ = 1; // Make sure to change this
int fact[FACSZ],ifact[FACSZ];
void precom(int c = MOD){
fact[0] = 1;
FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
REPD(i,FACSZ-1){
ifact[i] = mul(i+1,ifact[i+1],c);
}
}
int ncr(int n,int r,int c = MOD){
return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
}
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
void solvethetestcase();
signed main(){
// (UNCOMMENT FOR CIN/COUT) \
FAST_IO
PRECISION(10)
int t = 1;
// (UNCOMMENT FOR MULTIPLE TEST CASES) \
sfl(t);
FOR(testcase,1,t+1){
// (UNCOMMENT FOR CODEJAM) \
printf("Case #%lld: ",testcase);
solvethetestcase();
}
}
int n,m,q;
vpii adj[50005];
pair<pii,int> bridges[100005];
int BLK = 1000;
int par[50005];
int sz[50005];
int find(int x){
if(par[x] == x) return x;
return find(par[x]);
// no path compression cuz rollbacks
}
int find2(int x){
if(par[x] == x) return x;
return par[x] = find(par[x]);
}
stack<int> st;
void merge(int u,int v){
u = find(u);
v = find(v);
if(u == v) return;
if(sz[u] > sz[v]) swap(u,v);
par[u] = v;
sz[v]+=sz[u];
st.push(u);
}
void merge2(int u,int v){
u = find2(u);
v = find2(v);
if(u == v) return;
if(sz[u] > sz[v]) swap(u,v);
par[u] = v;
sz[v]+=sz[u];
}
void rollback(){
int u = st.top();
sz[par[u]]-=sz[u];
par[u] = u;
st.pop();
}
vector<pair<pii,int> > upd,quer;
vi ggedg;
bitset<100005> chan;
vi todo[100005];
void respawn(){
upd.clear();
quer.clear();
chan.reset();
REP(i,n+3){
sz[i] = 1;
par[i] = i;
}
ggedg.clear();
while(st.size()) st.pop();
}
bool cmp(int x,int y){
return bridges[x].S > bridges[y].S;
}
void solvethetestcase(){
sfl2(n,m)
FOR(i,1,m+1){
int u,v,w;
sfl3(u,v,w)
adj[u].pb({v,i});
adj[v].pb({u,i});
bridges[i] = {{u,v},w};
// trace(i,bridges[i].S);
}
sfl(q)
int l = 0;
respawn();
vpii result;
REP(i,q){
if(1){
int t;
sfl(t)
if(t == 1){
int e,val;
sfl2(e,val)
chan[e] = 1;
upd.pb({{e,val},i});
}
else{
int u,w;
sfl2(u,w)
quer.pb({{-w,u},i});
}
}
if(i == q-1 or (i+1)%BLK == 0){
// trace(i);
FOR(j,1,m+1){
if(!chan[j]) ggedg.pb(j);
}
int c1 = 0,c2 = 0;
while(c1 < upd.size() or c2 < quer.size()){
if(c1 != upd.size() and (c2 == quer.size() or upd[c1].S < quer[c2].S)){
bridges[upd[c1].F.F].S = upd[c1].F.S;
c1++;
}
else{
for(auto x:upd){
if(bridges[x.F.F].S >= -quer[c2].F.F) todo[quer[c2].S].pb(x.F.F);
}
c2++;
}
}
sort(all(quer));
sort(all(ggedg),cmp);
int zz = 0;
for(auto x:quer){
// trace(x.F.F,x.F.S,x.S);
while(zz < ggedg.size() and bridges[ggedg[zz]].S >= -x.F.F){
// trace(zz,ggedg[zz]);
merge2(bridges[ggedg[zz]].F.F,bridges[ggedg[zz]].F.S);
zz++;
}
int ss = st.size();
for(auto y:todo[x.S]){
// trace(y);
merge2(bridges[y].F.F,bridges[y].F.S);
}
result.pb({x.S,sz[find(x.F.S)]});
while(st.size() != ss) rollback();
}
respawn();
}
}
sort(all(result));
// for(auto x:result){
// pfl(x.S)
// }
// cout << runtime() << endl;
}
