// 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 + 4;
const int maxm = 500 + 4;
const int maxs = 1e6 + 4;
const int oo = 1e9 + 3;
int p[maxn], sz[maxn]; pii ind[maxn];
int E1[maxn][maxm], s1[maxn];
int E2[maxn][maxm], s2[maxn];
vector<int> arr, arrx, Q, vc;
vector<pair<pii, int>> E;
pll res[maxs];
inline int GIx(int x) {
return lower_bound(all(arrx), x) - arrx.begin();
}
int get(int a) {
return (p[a] == a) ? a : p[a] = get(p[a]);
}
inline 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;
}
inline bool cmp(int r1, int r2, int x) {
int w1 = abs(x - E[r1].S), w2 = abs(x - E[r2].S);
return (Mp(w1, r1) < Mp(w2, r2));
}
inline bool cmpx(pair<pii, int> x, pair<pii, int> y) {
return (x.S < y.S);
}
inline void add_val(int l, int 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;
}
inline void cal(int x, int j) {
vc.clear();
iota(p, p + n, 0); fill(sz, sz + n, 1);
int p1 = 0, p2 = 0;
while (p1 < s1[j - 1] && p2 < s2[j]) {
int r1 = E1[j - 1][p1], r2 = E2[j][p2];
if (cmp(r1, r2, x)) {
if (merge(E[r1].F.F, E[r1].F.S)) vc.pb(r1);
p1++;
}
else {
if (merge(E[r2].F.F, E[r2].F.S)) vc.pb(r2);
p2++;
}
}
while (p1 < s1[j - 1]) {
int r1 = E1[j - 1][p1];
if (merge(E[r1].F.F, E[r1].F.S)) vc.pb(r1);
p1++;
}
while (p2 < s2[j]) {
int r2 = E2[j][p2];
if (merge(E[r2].F.F, E[r2].F.S)) vc.pb(r2);
p2++;
}
}
inline void cal1(int ind, int i) {
iota(p, p + n, 0); fill(sz, sz + n, 1);
int ux = E[ind].F.F, vx = E[ind].F.S; int wx = E[ind].S;
int j = find(E2[i], E2[i] + s2[i], ind) - E2[i];
for (int r = 0; r < j; r++) {
int x = E2[i][r];
int u = E[x].F.F, v = E[x].F.S;
merge(u, v);
}
for (int r = 0; r < s1[i - 1]; r++) {
int x = E1[i - 1][r];
int u = E[x].F.F, v = E[x].F.S;
if ((get(u) == get(ux) && get(v) == get(vx)) || (get(u) == get(vx) && get(v) == get(ux))) {
int w = E[x].S;
int R = (w + wx) / 2;
if (!cmp(ind, x, R)) R++;
add_val(R, wx + 1, Mp(-1, wx));
return ;
}
merge(u, v);
}
add_val(-oo, wx + 1, Mp(-1, wx));
}
inline void cal2(int ind, int i) {
iota(p, p + n, 0); fill(sz, sz + n, 1);
int ux = E[ind].F.F, vx = E[ind].F.S; int wx = E[ind].S;
int j = find(E1[i], E1[i] + s1[i], ind) - E1[i];
for (int r = 0; r < j; r++) {
int x = E1[i][r];
int u = E[x].F.F, v = E[x].F.S;
merge(u, v);
}
for (int r = 0; r < s2[i + 1]; r++) {
int x = E2[i + 1][r];
int u = E[x].F.F, v = E[x].F.S;
if ((get(u) == get(ux) && get(v) == get(vx)) || (get(u) == get(vx) && get(v) == get(ux))) {
int w = E[x].S;
int R = (w + wx) / 2;
if (!cmp(ind, x, R)) R--;
add_val(wx, R + 1, Mp(1, -wx));
return ;
}
merge(u, v);
}
add_val(wx, oo, Mp(1, -wx));
}
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
arr.pb(-oo); arr.pb(oo);
arrx.pb(-oo); arrx.pb(oo);
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);
}
sort(all(E), cmpx);
cin >> q;
for (int i = 0; i < q; i++) {
int x; cin >> x;
Q.pb(x); arrx.pb(x);
}
sort(all(arr)); arr.resize(unique(all(arr)) - arr.begin());
sort(all(arrx)); arrx.resize(unique(all(arrx)) - arrx.begin());
int j = 0;
for (int i = 0; i < len(arr); i++) {
iota(p, p + n, 0); fill(sz, sz + n, 1);
while (j < m && arr[i] > E[j].S) j++;
while (j < m && arr[i] == E[j].S) {
int u = E[j].F.F, v = E[j].F.S;
if (merge(u, v)) E1[i][s1[i]++] = j;
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;
}
}
}
j = m - 1;
for (int i = len(arr) - 1; i >= 0; i--) {
iota(p, p + n, 0); fill(sz, sz + n, 1);
int j1 = j, j2 = j;
while (j >= 0 && arr[i] < E[j].S) j--, j1--, j2--;
while (j >= 0 && arr[i] == E[j].S) j--, j1--;
for (int j = j1 + 1; j <= j2; j++) {
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;
}
}
}
fill(ind, ind + m, Mp(oo, -oo));
for (int i = 1; i < len(arr) - 1; i++) {
cal(arr[i], i);
for (int j : vc) {
ind[j].F = min(ind[j].F, i);
ind[j].S = max(ind[j].S, i);
}
}
for (int i = 0; i < m; i++) {
if (ind[i].F == oo) continue;
int i1 = ind[i].F, i2 = ind[i].S;
cal1(i, i1); cal2(i, i2);
}
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;
}
