#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() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector e(100005, vector<P>());
	rep(i, m) {
		int u, v, w; cin >> u >> v >> w;
		e[v].push_back({ u,v });
	}
	vector<int>ans(100005);
	int cnt = n;
	dsu uf(n);
	rep(i, 100005) {
		for (auto[u, v] : e[i]) {
			if (uf.same(u, v))continue;
			cnt--;
			uf.merge(u, v);
		}
		ans[i] = cnt;
	}
	int t; cin >> t;
	while (t--) {
		int x; cin >> x;
		cout << ans[x] << endl;
	}
	return 0;
}