// In the name of Allah
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define len(x) ((ll) (x).size())
#define F first
#define S second
#define pb push_back
#define sep ' '
#define endl '\n'
#define Mp make_pair
#define kill(x) cout << x << '\n', exit(0)
#define set_dec(x) cout << fixed << setprecision(x);
#define file_io(x,y) freopen(x, "r", stdin); freopen(y, "w", stdout);
int n, m, q;
const int maxn = 1e5 + 7;
const int maxm = 500 + 7;
const int maxs = 2e6 + 4;
const ll oo = 1e9 + 3;
vector<int> adj[maxn];
int p[maxn], sz[maxn];
int E1[maxn][maxm], s1[maxn];
int E2[maxn][maxm], s2[maxn];
vector<int> A[maxn]; vector<ll> arr, arrx;
vector<pair<pii, ll>> E; vector<ll> Q;
int mark[maxn], col[maxn], c = 0;
pll res[maxs];
int GI(ll x) {
return lower_bound(all(arr), x) - arr.begin();
}
int GIx(ll x) {
return lower_bound(all(arrx), x) - arrx.begin();
}
void dfs(int v) {
mark[v] = 1; col[v] = c;
for (int u : adj[v]) {
if (mark[u]) continue;
dfs(u);
}
}
int get(int a) {
return (p[a] == a) ? a : p[a] = get(p[a]);
}
bool merge(int a, int b) {
a = get(a); b = get(b);
if (a == b) return 0;
if (sz[a] > sz[b]) swap(a, b);
p[a] = b; sz[b] += sz[a]; sz[a] = 0;
return 1;
}
bool f1(ll val, int i, int j) {
for (int r = 0; r < n; r++) adj[r].clear();
int e = E1[i][j]; ll w = arr[E[e].S];
for (int r = 0; r < j; r++) {
int x = E1[i][r];
int u = E[x].F.F, v = E[x].F.S;
adj[u].pb(v); adj[v].pb(u);
}
for (int r = 0; r < s2[i + 1]; r++) {
int x = E2[i + 1][r];
if (abs(w - val) <= abs(arr[E[x].S] - val)) continue;
int u = E[x].F.F, v = E[x].F.S;
adj[u].pb(v); adj[v].pb(u);
}
fill(mark, mark + n, 0); c = 0;
for (int i = 0; i < n; i++) {
if (!mark[i]) {
dfs(i); c++;
}
}
return (col[E[e].F.F] != col[E[e].F.S]);
}
bool f2(ll val, int i, int j) {
for (int r = 0; r < n; r++) adj[r].clear();
int e = E2[i][j]; ll w = arr[E[e].S];
for (int r = 0; r < j; r++) {
int x = E2[i][r];
int u = E[x].F.F, v = E[x].F.S;
adj[u].pb(v); adj[v].pb(u);
}
for (int r = 0; r < s1[i - 1]; r++) {
int x = E1[i - 1][r];
if (abs(w - val) < abs(arr[E[x].S] - val)) continue;
int u = E[x].F.F, v = E[x].F.S;
adj[u].pb(v); adj[v].pb(u);
}
fill(mark, mark + n, 0); c = 0;
for (int i = 0; i < n; i++) {
if (!mark[i]) {
dfs(i); c++;
}
}
return (col[E[e].F.F] != col[E[e].F.S]);
}
void add_val(ll l, ll r, pll x) {
if (r <= l) return ;
l = GIx(l); r = GIx(r);
res[l].F += x.F; res[l].S += x.S;
res[r].F -= x.F; res[r].S -= x.S;
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 0; i < m; i++) {
int u, v, w;
cin >> u >> v >> w; u--; v--;
E.pb(Mp(Mp(u, v), w));
arr.pb(w); arrx.pb(w);
}
cin >> q;
for (int i = 0; i < q; i++) {
ll x; cin >> x;
Q.pb(x); arrx.pb(x);
}
arr.pb(-oo); arr.pb(oo);
arrx.pb(-oo); arrx.pb(oo);
sort(all(arr)); arr.resize(unique(all(arr)) - arr.begin());
sort(all(arrx)); arrx.resize(unique(all(arrx)) - arrx.begin());
for (int i = 0; i < m; i++) {
E[i].S = GI(E[i].S);
A[E[i].S].pb(i);
}
for (int i = 0; i < len(arr); i++) {
iota(p, p + n, 0); fill(sz, sz + n, 1);
for (int j : A[i]) {
int u = E[j].F.F, v = E[j].F.S;
if (merge(u, v)) E1[i][s1[i]++] = j;
}
if (i - 1 >= 0) {
for (int r = 0; r < s1[i - 1]; r++) {
int j = E1[i - 1][r];
int u = E[j].F.F, v = E[j].F.S;
if (merge(u, v)) E1[i][s1[i]++] = j;
}
}
}
for (int i = len(arr) - 1; i >= 0; i--) {
iota(p, p + n, 0); fill(sz, sz + n, 1);
for (int j : A[i]) {
int u = E[j].F.F, v = E[j].F.S;
if (merge(u, v)) E2[i][s2[i]++] = j;
}
if (i + 1 < len(arr)) {
for (int r = 0; r < s2[i + 1]; r++) {
int j = E2[i + 1][r];
int u = E[j].F.F, v = E[j].F.S;
if (merge(u, v)) E2[i][s2[i]++] = j;
}
}
}
for (int i = 0; i < len(arr) - 1; i++) {
for (int j = 0; j < s1[i]; j++) {
int x = E1[i][j];
ll l = arr[i], r = arr[i + 1] + 1;
while (r - l > 1) {
ll mid = (l + r) / 2;
if (f1(mid, i, j)) l = mid;
else r = mid;
}
add_val(arr[i] + 1, r, Mp(1, -arr[E[x].S]));
}
}
for (int i = len(arr) - 1; i >= 1; i--) {
for (int j = 0; j < s2[i]; j++) {
int x = E2[i][j];
ll l = arr[i - 1], r = arr[i] + 1;
while (r - l > 1) {
ll mid = (l + r) / 2;
if (!f2(mid, i, j)) l = mid;
else r = mid;
}
add_val(r, arr[i] + 1, Mp(-1, arr[E[x].S]));
}
}
for (int i = 1; i <= len(arrx); i++) {
res[i].F += res[i - 1].F; res[i].S += res[i - 1].S;
}
for (int i = 0; i < q; i++) {
ll x = Q[i]; int j = GIx(x);
cout << res[j].F * x + res[j].S << endl;
}
return 0;
}
