// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXM = 100005;
const int MAXN = 505;
const int MAXQ = 1000005;
int n, m;
iii edges[MAXM];
int q;
ii qry[MAXQ];
vii vw[MAXN];
int lft[MAXM], rht[MAXM];
ll ans[MAXQ];
int rp[MAXN], rnk[MAXN];
void init() {
REP (i, 1, n + 1) {
rnk[i] = 1;
rp[i] = i;
}
}
int findp(int i) {
if (rp[i] == i) return i;
return rp[i] = findp(rp[i]);
}
bool join(int a, int b) {
int pa = findp(a), pb = findp(b);
if (pa == pb) return 0;
if (rnk[pa] < rnk[pb]) swap(pa, pb);
if (rnk[pa] == rnk[pb]) rnk[pa]++;
rp[pb] = pa;
return 1;
}
bool isPos(int x, int id) {
auto [ra, rb, rw] = edges[id];
init();
REP (i, 0, m) {
if (i == id) {
continue;
}
auto [a, b, w] = edges[i];
if (ii{abs(w - x), i} < ii{abs(rw - x), id}) {
join(a, b);
}
}
return join(ra, rb);
}
int main() {
#ifndef DEBUG
ios::sync_with_stdio(0), cin.tie(0);
#endif
cin >> n >> m;
REP (i, 0, m) {
int a, b, w; cin >> a >> b >> w;
edges[i] = {a, b, w};
}
cin >> q;
REP (i, 0, q) {
cin >> qry[i].FI;
qry[i].SE = i;
}
viii ev;
REP (i, 0, m) {
auto [a, b, w] = edges[i];
int lo = w - 1, hi = INF;
while (lo < hi) {
int mid = lo + hi + 1 >> 1;
if (isPos(mid, i)) {
lo = mid;
} else {
hi = mid - 1;
}
}
rht[i] = lo + 1;
lo = 0, hi = w + 1;
while (lo < hi) {
int mid = lo + hi >> 1;
if (isPos(mid, i)) {
hi = mid;
} else {
lo = mid + 1;
}
}
lft[i] = hi;
cerr << i << ": " << lft[i] << ' ' << rht[i] << '\n';
ev.pb({lft[i], w, 1});
ev.pb({w + 1, -2 * w, -2});
ev.pb({rht[i], w, 1});
}
sort(ALL(ev));
int j = 0;
ll res = 0;
int minus = 0;
REP (i, 0, q) {
auto [x, id] = qry[i];
while (j < SZ(ev) && get<0>(ev[j]) <= x) {
auto [a, b, c] = ev[j];
res += b;
minus += c;
j++;
}
ans[id] = res - (ll) x * minus;
}
REP (i, 0, q) {
cout << ans[i] << '\n';
}
return 0;
}
