#include using namespace std; #define OVERLOAD_REP(_1, _2, _3, name, ...) name #define REP1(i, n) for (auto i = std::decay_t{}; (i) != (n); ++(i)) #define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i)) #define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__) #define REP(i, l, r) rep(i, l, r+1) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() using ll = long long; using ld = long double; using P = pair; struct Edge { int to; ll w; }; using Graph = vector >; //using Graph = vector >; const ll INF = 2e18; //const int INF = 2e9; template using vc = vector; template using vv = vector >; template using vvv = vector > >; template using pq = priority_queue; template using pq_g = priority_queue, greater >; template istream& operator>>(istream& i, vc& v) { rep(j, 0, v.size()) i>>v[j]; return i; } template ostream& operator<<(ostream& o, vc& v) { rep(j, 0, v.size()) o< bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; } template bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; } struct UnionFind { std::vector par, siz; int count; UnionFind(int n) : par(n, -1), siz(n, 1), count(n) {} int root(int n) { if(par[n] == -1) return n; else return par[n] = root(par[n]); } bool issame(int a, int b) { return root(a) == root(b); } bool unite(int a, int b) { a = root(a); b = root(b); if(a == b) return false; if(siz[a] < siz[b]) swap(a, b); par[b] = a; siz[a] += siz[b]; count--; return true; } int size(int a) { return siz[root(a)]; } }; int main() { // 高速化 ios::sync_with_stdio(false); cin.tie(nullptr); // 小数点の出力桁数を指定 cout << fixed << setprecision(10); // メイン int N, M, T; cin >> N >> M; int W = 100001; vv

edges(W); rep(i, 0, M) { int u, v, w; cin >> u >> v >> w; edges[w].push_back({u, v}); } UnionFind uf(N); vc ans(W); rep(w, 0, W) { ans[w] = uf.count; for(P p : edges[w]) { uf.unite(p.first, p.second); } } cin >> T; while(T--) { int R; cin >> R; cout << ans[R+1] << endl; } return 0; }