#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
void _main();
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	_main();
	return 0;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vl = std::vector<ll>;
using vii = std::vector<pair<int, int> >;
using vvl = std::vector<vl>;
using vll = std::vector<pair<ll , ll> >;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using vs = std::vector<std::string>;
using vvs = std::vector<vs>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;
using vc = std::vector<char>;
using vvc = std::vector<vc>;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using piil = std::pair<pair<int, int>, ll>;
using mii = std::map<int, int>;
using mll = std::map<ll, ll>;
using pql = std::priority_queue<ll>;
using pqi = std::priority_queue<int>;
using pqiil = std::priority_queue<pair<pair<int, int>, ll> >;
using pqii = std::priority_queue<pair<int, int> >;

#define pb push_back
#define ps push
#define eb emplace_back
#define is insert
#define er erase
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sf(i) sizeof(i)
#define endl "\n"
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define rep(i, L, R) for(ll i = L;i<=R;i++)
#define pcis precision

template<typename T>
struct infinity {
	static constexpr T max=std::numeric_limits<T>::max();
	static constexpr T min=std::numeric_limits<T>::min();
	static constexpr T value=std::numeric_limits<T>::max()/2;
	static constexpr T mvalue=std::numeric_limits<T>::min()/2;
};
template<typename T>constexpr T INF=infinity<T>::value;
constexpr ll lINF=INF<ll>;
constexpr int iINF = INF<int>;
constexpr ld PI = 3.1415926535897932384626;

struct UnionFindWithRollback {
	long long parent[300100];
	stack<tuple<int,int,int>> S;
	UnionFindWithRollback() {
		memset(parent, -1, sizeof(parent));
	}
	int find(int x) {
		if(parent[x]<0) return x;
		return find(parent[x]);
	}
	bool uni(int x, int y) {
		x = find(x), y = find(y);
		if(x == y) return 0;
		if(parent[x] < parent[y]) swap(x,y);
		S.push({x, y, parent[x]});
		parent[y] += parent[x];
		parent[x] = y;
		return 1;
	}
	void rollback() {
		int x = get<0>(S.top()), y = get<1>(S.top()), sz = get<2>(S.top());
		parent[y] -= sz;
		parent[x] = sz;
		S.pop();
	}
} uf;

void _main() {

	ll N, M;
	cin >>N >>M;

	priority_queue<pair<ll, pll>, vector<pair<ll, pll>>, greater<pair<ll, pll>>> pq;

	for (ll i = 1; i<=M; i++) {
		ll a, b, c;
		cin >>a >>b>>c;
		pq.ps({c, {a,b}});
	}

	ll Q;
	cin >> Q;
	pll A[Q+1];
	for (ll i = 1; i<=Q; i++) {
		cin >> A[i].f;
		A[i].s = i;
	}
	sort(A+1, A+Q+1);
	ll ANS[Q+1];
	ll RES = N;
	for (ll i = 1; i<=Q; i++) {
		auto [atai,idx] = A[i];

		while (!pq.empty() && pq.top().f <= atai) {
			RES -= uf.uni(pq.top().s.f, pq.top().s.s);
			pq.pop();
		}
		ANS[idx] = RES;
	}

	for (ll i = 1; i<=Q; i++) {
		cout << ANS[i] << endl;
	}








}