#include <bits/stdc++.h>
using namespace std;
struct dsu {
private: vector<int> p, sz;
public:
dsu(int n) {
p.assign(n, -1);
sz.assign(n, 1);
}
int root(int x) {
if (p[x] < 0) {
return x;
}
return (p[x] = root(p[x]));
}
bool same_set(int x, int y) {
return (root(x) == root(y));
}
void connect(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (sz[x] > sz[y]) {
p[y] = x;
sz[x] += sz[y];
} else {
p[x] = y;
sz[y] += sz[x];
}
}
}
int set_sz(int x) {
return sz[root(x)];
}
};
struct edge {
int u, v, d, idx;
};
struct query {
int type, x, y, idx;
};
vector<int> was;
vector< vector<int> > g;
dsu conn(0);
int cnt = 0;
int dfs(int u) {
was[u] = cnt;
int ans = conn.set_sz(u);
for (auto& v : g[u]) {
if (was[v] != cnt) {
ans += dfs(v);
}
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<edge> edges(m);
for (int i = 0; i < m; i++) {
cin >> edges[i].u >> edges[i].v >> edges[i].d;
edges[i].idx = i;
}
vector<edge> unsorted_edges(edges);
int q;
cin >> q;
vector<query> queries(q);
for (int i = 0; i < q; i++) {
cin >> queries[i].type >> queries[i].x >> queries[i].y;
queries[i].idx = i;
}
sort(edges.begin(), edges.end(), [](const edge &a, const edge &b) {
return a.d > b.d;
});
const int k = floor(sqrt(q));
vector<int> ans(q, -1);
g.resize(n + 1);
was.assign(n + 1, -1);
for (int i = 0; i < q; i += k) {
conn = dsu(n + 1);
vector<query> q1, q2;
vector<bool> use(m, true);
for (int j = i; j < min(q, i + k); j++) {
if (queries[j].type == 1) {
q2.push_back(queries[j]);
use[queries[j].x - 1] = false;
} else {
q1.push_back(queries[j]);
}
}
sort(q1.begin(), q1.end(), [](const query &a, const query &b) {
return a.y > b.y;
});
int ptr = 0;
for (int j = 0; j < (int) q1.size(); j++) {
while (ptr < m && edges[ptr].d >= q1[j].y) {
if (use[edges[ptr].idx]) {
conn.connect(edges[ptr].u, edges[ptr].v);
}
ptr++;
}
for (int t = 0; t < (int) q2.size(); t++) {
if (q2[t].idx > q1[j].idx) {
if (unsorted_edges[q2[t].x - 1].d >= q1[j].y) {
int u = conn.root(unsorted_edges[q2[t].x - 1].u);
int v = conn.root(unsorted_edges[q2[t].x - 1].v);
g[u].push_back(v);
g[v].push_back(u);
}
continue;
}
if (q2[t].y >= q1[j].y) {
int u = conn.root(unsorted_edges[q2[t].x - 1].u);
int v = conn.root(unsorted_edges[q2[t].x - 1].v);
g[u].push_back(v);
g[v].push_back(u);
}
}
ans[q1[j].idx] = dfs(conn.root(q1[j].x));
cnt++;
for (int t = 0; t < (int) q2.size(); t++) {
if (q2[t].idx > q1[j].idx) {
if (unsorted_edges[q2[t].x - 1].d >= q1[j].y) {
int u = conn.root(unsorted_edges[q2[t].x - 1].u);
int v = conn.root(unsorted_edges[q2[t].x - 1].v);
g[u].clear();
g[v].clear();
}
continue;
}
if (q2[t].y >= q1[j].y) {
int u = conn.root(unsorted_edges[q2[t].x - 1].u);
int v = conn.root(unsorted_edges[q2[t].x - 1].v);
g[u].clear();
g[v].clear();
}
}
}
vector<edge> changed, not_changed;
for (int j = 0; j < m; j++) {
if (use[edges[j].idx]) {
not_changed.push_back(edges[j]);
}
}
for (int j = 0; j < (int) q2.size(); j++) {
unsorted_edges[q2[j].x - 1].d = q2[j].y;
changed.push_back(unsorted_edges[q2[j].x - 1]);
}
sort(changed.begin(), changed.end(), [](const edge &a, const edge &b) {
return a.d > b.d;
});
edges.clear();
int j = 0, t = 0;
while (j < (int) not_changed.size() || t < (int) changed.size()) {
if (j == (int) not_changed.size()) {
edges.push_back(changed[t++]);
} else if (t == (int) changed.size()) {
edges.push_back(not_changed[j++]);
} else if (not_changed[j].d > changed[t].d) {
edges.push_back(not_changed[j++]);
} else {
edges.push_back(changed[t++]);
}
}
}
for (int i = 0; i < q; i++) {
if (ans[i] != -1) {
cout << ans[i] << '\n';
}
}
return 0;
}
