// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
const int INF = 1e9 , mod = 1e9 + 7;
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
#define PROB "a"
void file(){
if(fopen(PROB".inp", "r")){
freopen(PROB".inp","r",stdin);
freopen(PROB".out","w",stdout);
}
}
void sinh_(){
// srand(time(0));
// freopen(PROB".inp" , "w" , stdout);
// int n;
}
typedef long long ll;
typedef double db;
const int N = 1e5 + 5;
const int S = 350;
int n, m, q;
int par[N], sz[N];
int mark[N] = {}, num = 0, numRemain, curW[N];
int ans[N];
struct Data{
int u, su, v, sv;
Data(int _u = 0, int _su = 0, int _v = 0, int _sv = 0) {
u = _u, su = _su, v = _v, sv = _sv;
}
} st[N];
int roll_back_size;
struct edge{
int u, v, w;
edge(int _u = 0, int _v = 0, int _w = 0) {
u = _u, v = _v, w = _w;
}
bool operator < (const edge &other) const {
return w > other.w;
}
} Edge[N], remained_edge[N];
struct query{
int type, u, w;
query(int _type = 0, int _u = 0, int _w = 0) {
type = _type, u = _u, w = _w;
}
} Query[N];
void readip(){
cin >> n >> m;
REP(i, 1, m) cin >> Edge[i].u >> Edge[i].v >> Edge[i].w;
cin >> q;
REP(i, 1, q) cin >> Query[i].type >> Query[i].u >> Query[i].w;
}
void init() {
REP(i, 1, n) par[i] = i, sz[i] = 1;
roll_back_size = 0;
}
int root(int x) { if (x == par[x]) return x; return root(par[x]); }
void unite(int u, int v, bool hold) {
u = root(u) , v = root(v);
if (u == v) return;
if (!hold) st[++roll_back_size] = {u, sz[u], v, sz[v]};
if (sz[u] < sz[v]) swap(u, v);
sz[u] += sz[v];
par[v] = u;
}
void roll_back() {
while(roll_back_size > 0) {
const auto &[u, su, v, sv] = st[roll_back_size--];
par[u] = u, sz[u] = su;
par[v] = v, sz[v] = sv;
}
}
void solve(){
vector<int> active_edges;
vector<int> order;
for (int l = 1; l <= q; ++l) {
int r = min(q, l + S - 1);
++num;
active_edges.clear();
order.clear();
REP(i, l, r) {
if (Query[i].type == 1) {
if (mark[Query[i].u] != num) {
mark[Query[i].u] = num;
active_edges.eb(Query[i].u);
}
}
else order.eb(i);
}
numRemain = 0;
REP(i, 1, m) if (mark[i] != num) remained_edge[++numRemain] = Edge[i];
sort(remained_edge + 1, remained_edge + numRemain + 1);
sort(ALL(order), [&](const int &x, const int &y){
return Query[x].w > Query[y].w;
});
init();
int pt = 1;
for (int i : order) {
while(pt <= numRemain && remained_edge[pt].w >= Query[i].w) {
unite(remained_edge[pt].u, remained_edge[pt].v, 1);
++pt;
}
for (int id : active_edges) curW[id] = Edge[id].w;
REP(k, l, i) if (Query[k].type == 1)
curW[Query[k].u] = Query[k].w;
for (int id : active_edges) if (curW[id] >= Query[i].w)
unite(Edge[id].u, Edge[id].v, 0);
ans[i] = sz[root(Query[i].u)];
roll_back();
}
REP(k, l, r) if (Query[k].type == 1)
Edge[Query[k].u].w = Query[k].w;
l = r;
}
REP(i, 1, q) if (Query[i].type == 2) cout << ans[i] << ln;
}
int main(){
sinh_();
io_faster
file();
int t = 1;
// cin >> t;
while (t--){
readip();
solve();
}
}
