#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
//practically constant time - dsu with path compression
// if(e[x] < 0) e[x] is root and size is -e[x] else e[x] is parent of x;
// kactl icpc notebook
struct dsu_save{
int v, rnkv, u, rnku;
};
struct dsu{
vector<int> e;
stack<dsu_save> rb;
dsu(){};
dsu(int n){
e.resize(n, -1);
}
int find(int x){ return (e[x] < 0 ? x : find(e[x])); }
int size(int x){ return -e[find(x)]; }
int sameSet(int a, int b){ return find(a) == find(b); }
bool join(int a, int b){
a = find(a); b = find(b);
if(a == b) return false;
if(e[a] > e[b]) swap(a, b);
rb.push({a, e[a], b, e[b]});
e[a] += e[b]; e[b] = a;
return true;
}
void rollback(){
if(rb.empty()) return;
dsu_save last = rb.top();
rb.pop();
e[last.v] = last.rnkv;
e[last.u] = last.rnku;
}
};
template<typename T>
struct edge{
int src;
int dest;
T cost;
};
template<typename T>
class graph{
public:
vector<edge<T>> edges;
vector<vector<int>> adj;
int n;
graph(){};
graph(int _n){
n = _n;
adj.resize(n);
}
};
template<typename T>
class undigraph : public graph<T>{
public:
using graph<T>::edges;
using graph<T>::adj;
using graph<T>::n;
undigraph() : graph<T>(){};
undigraph(int _n) : graph<T>(_n){};
int add_edge(int src, int dest, T cost = 1){
int id = edges.size();
edges.push_back({src, dest, cost});
adj[src].push_back(id);
adj[dest].push_back(id);
return id;
}
};
bool operator<(edge<int> lhs, edge<int> rhs){
return make_tuple(lhs.cost, lhs.src, lhs.dest) < make_tuple(rhs.cost, rhs.src, rhs.dest);
}
struct query{
int t, a, b;
};
// pridavam hrany co maju mensie do dsu, aj keby som mal pridavat hrany co maju vacsie wahy. Zajtra to prejdi este.
struct AcAutomaton{
int UPD = 1;
int ASK = 2;
int n, m, q;
vector<query> queries;
vector<pair<edge<int>, int>> edges;
vi out;
void read_in(){
cin >> n >> m;
REP(i, m){
int u, v, c; cin >> u >> v >> c; --u; --v;
edge<int> e = {u ,v, c};
edges.pb(mp(e, i));
}
cin >> q;
out.rsz(q, -1);
REP(i, q){
int t, a, b; cin >> t >> a >> b;
--a;
queries.pb({t, a, b});
}
}
void solve_bucket(int l, int r){
vector<pair<query, int>> questions;
vector<bool> affected(m+5, false);
vector<pair<edge<int>, int>> n_edges;
vector<pair<edge<int>, int>> p_edges;
vi ind_qry_edg;
FOR(i, l, r, 1){
if(queries[i].t == ASK){
questions.pb(mp(queries[i], i));
}
else{
affected[queries[i].a] = true;
n_edges.pb(edges[queries[i].a]);
p_edges.pb(edges[queries[i].a]);
ind_qry_edg.pb(i);
n_edges[n_edges.size()-1].ff.cost = queries[i].b;
}
}
vector<edge<int>> sorted_edges;
for(auto x : edges){
if(!affected[x.ss]) sorted_edges.pb(x.ff);
}
sort(all(sorted_edges)); reverse(all(sorted_edges));
sort(all(questions), [](pair<query,int> lhs, pair<query, int> rhs){return lhs.ff.b < rhs.ff.b;}); reverse(all(questions));
int pp = 0;
dsu d(n+1);
int cnt = 0;
REP(i, questions.size()){
cnt = 0;
pp = 0;
while(pp < sorted_edges.size() && sorted_edges[pp].cost >= questions[i].ff.b){
//dbg(mp(sorted_edges[pp].src, sorted_edges[pp].dest));
d.join(sorted_edges[pp].src, sorted_edges[pp].dest);
++pp;
}
REP(j, n_edges.size()){
if(ind_qry_edg[j] < questions[i].ss){
if(n_edges[j].ff.cost >= questions[i].ff.b){
if(d.join(n_edges[j].ff.src, n_edges[j].ff.dest)) ++cnt;
}
}
else{
if(p_edges[j].ff.cost >= questions[i].ff.b){
if(d.join(p_edges[j].ff.src, p_edges[j].ff.dest)) ++cnt;
}
}
}
out[questions[i].ss] = d.size(questions[i].ff.a);
while(cnt--) d.rollback();
}
REP(i, n_edges.size()){
edges[n_edges[i].ss] = n_edges[i];
}
}
void solve(){
int bucketsize = 700;
FOR(i, 0, q, bucketsize){
solve_bucket(i, min(q,i+bucketsize));
}
REP(i,q){
if(queries[i].t == ASK) cout << out[i] << endl;
}
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int tcase = 1;
while(tcase--){
AcAutomaton solver;
solver.read_in();
solver.solve();
}
return 0;
}
