#include <algorithm>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
struct UnionFind {
vector<int> parent; // parent[root] is the negative of the size.
UnionFind(int n) : parent(n, -1){};
bool unite(int u, int v) {
u = root(u);
v = root(v);
if (u == v) return false;
if (parent[u] > parent[v]) swap(u, v);
parent[u] += parent[v];
parent[v] = u;
return true;
}
bool find(int u, int v) { return root(u) == root(v); }
int root(int u) { return parent[u] < 0 ? u : parent[u] = root(parent[u]); }
int size(int u) { return -parent[root(u)]; }
};
struct Edge {
int a, b, y;
};
struct Query {
int i, v, w;
};
int main() {
int N, M;
while (cin >> N >> M) {
vector<Edge> edges;
for (int i = 0; i < M; i++) {
int a, b, y;
cin >> a >> b >> y;
--a;
--b;
edges.push_back(Edge{a, b, y});
}
sort(edges.begin(), edges.end(),
[&](auto &a, auto &b) { return a.y > b.y; });
int Q;
cin >> Q;
vector<Query> queries;
for (int i = 0; i < Q; i++) {
int v, w;
cin >> v >> w;
--v;
queries.push_back(Query{i, v, w});
}
sort(queries.begin(), queries.end(),
[&](auto &a, auto &b) { return a.w > b.w; });
vector<int> res(Q);
UnionFind uf(N);
int i = 0;
for (auto &q : queries) {
while (i < M && edges[i].y > q.w) {
uf.unite(edges[i].a, edges[i].b);
++i;
}
res[q.i] = uf.size(q.v);
}
for (int x : res) cout << x << endl;
}
return 0;
}