#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m;
	cin >> n >> m;
	vector<vector<int>>eve;
	rep(i, m) {
		int u, v, l; cin >> u >> v >> l;
		u--, v--;
		eve.push_back({ l, 0, u, v });
	}

	int q; cin >> q;
	rep(i, q) {
		int p, t; cin >> p >> t;
		t--;
		eve.push_back({ p, 1, t, i });
	}
	sort(all(eve));
	dsu uf(n);
	vector<int>ans(q);
	rep(i, eve.size()) {
		if (eve[i][1] == 0) {
			uf.merge(eve[i][2], eve[i][3]);
		}
		else {
			int c = uf.size(eve[i][2]);
			ans[eve[i][3]] = c;
		}
	}
	rep(i, q)cout << ans[i] << endl;
	return 0;
}