#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
#define ll long long
#define f first
#define s second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
template<typename A> void __print(const A &x) {
bool first = true;
cerr << '{';
for (const auto &i : x) {
cerr << (first ? "" : ","), __print(i);
first = false;
}
cerr << '}';
}
template<typename A, typename B> void __print(const pair<A, B> &p) {
cerr << '(';
__print(p.f);
cerr << ',';
__print(p.s);
cerr << ')';
}
template<typename... A> void __print(const tuple<A...> &t) {
bool first = true;
cerr << '(';
apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
cerr << ')';
}
template<typename T> void __print(stack<T> s) {
vector<T> debugVector;
while (!s.empty()) {
T t = s.top();
debugVector.push_back(t);
s.pop();
}
reverse(debugVector.begin(), debugVector.end());
__print(debugVector);
}
template<typename T> void __print(queue<T> q) {
vector<T> debugVector;
while (!q.empty()) {
T t = q.front();
debugVector.push_back(t);
q.pop();
}
__print(debugVector);
}
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
vector<T> debugVector;
while (!q.empty()) {
T t = q.top();
debugVector.push_back(t);
q.pop();
}
__print(debugVector);
}
void _print() { cerr << "]\n"; }
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
__print(H);
if (sizeof...(T)) cerr << ", ";
_print(T...);
}
#ifdef DEBUG
#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
#define D(...)
#endif
const int SIZE = 1008;
int n, m, q, u[100005], v[100005], w[100005], t[100005], x[100005], y[100005], ans[100005], par[50005], sz[50005];
stack<int> stk;
vector<int> edge[2005], upd, qry, oth;
bool updated[100005];
void init() {
for (int i = 0; i <= n; i++) {
par[i] = i;
sz[i] = 1;
}
}
int find(int x) {
while (par[x] != x) x = par[x];
return x;
}
void merge(int x, int y) {
x = find(x);
y = find(y);
if (x != y) {
if (sz[x] < sz[y]) swap(x, y);
stk.push(y);
par[y] = par[x];
sz[x] += sz[y];
}
}
void undo(int x) {
while (stk.size() > x) {
int curr = stk.top();
stk.pop();
sz[par[curr]] -= sz[curr];
par[curr] = curr;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> u[i] >> v[i] >> w[i];
}
cin >> q;
for (int i = 1; i <= q; i++) {
cin >> t[i] >> x[i] >> y[i];
}
for (int l = 1, r, idx, csz; l <= q; l += SIZE) {
r = min(q + 1, l + SIZE);
fill(updated, updated + m + 1, false);
if (upd.size()) upd.clear();
if (qry.size()) qry.clear();
if (oth.size()) oth.clear();
init();
for (int i = l; i < r; i++) {
if (t[i] == 1) {
updated[x[i]] = true;
upd.push_back(i);
} else qry.push_back(i);
}
for (int i = 1; i <= m; i++) {
if (!updated[i]) {
oth.push_back(i);
}
}
for (int i = l; i < r; i++) {
if (t[i] == 1) {
w[x[i]] = y[i];
} else {
edge[i - l].clear();
for (int j : upd) {
if (w[x[j]] >= y[i]) {
edge[i - l].push_back(x[j]);
}
}
}
}
sort(qry.begin(), qry.end(), [&](int a, int b) {
return y[a] > y[b];
});
sort(oth.begin(), oth.end(), [&](int a, int b) {
return w[a] > w[b];
});
idx = 0, csz = 0;
for (int i : qry) {
while (idx < oth.size() && w[oth[idx]] >= y[i]) {
merge(u[oth[idx]], v[oth[idx]]);
idx++;
}
csz = stk.size();
for (int j : edge[i - l]) {
merge(u[j], v[j]);
}
ans[i] = sz[find(x[i])];
undo(csz);
}
}
for (int i = 1; i <= q; i++) {
if (t[i] == 2) cout << ans[i] << "\n";
}
}
