#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;
int N, M, Q, dsu[505];
pii E[100005];
ll w[100005], q[1000006], ans[1000006], lazy[1000006], use[100005];
vector<int> mst[1000006];
int find(int k)
{
return k == dsu[k] ? k : dsu[k] = find(dsu[k]);
}
void MST(int qdx, vector<int> &edx, bool keep = 0)
{
if(!mst[qdx].empty())
return;
for(int i = 1; i <= N; i++)
dsu[i] = i;
sort(edx.begin(), edx.end(), [&](int i, int j){ return make_pair(abs(q[qdx] - w[i]), i) < make_pair(abs(q[qdx] - w[j]), j); });
int cnt = N - 1;
for(auto i : edx)
{
if(find(E[i].F) != find(E[i].S))
{
dsu[find(E[i].F)] = find(E[i].S);
mst[qdx].emplace_back(i);
cnt--;
if(keep)
use[i] = 1;
}
if(!cnt) break;
}
sort(mst[qdx].begin(), mst[qdx].end());
}
void bs(int L, int R, vector<int> v)
{
MST(L, v);
MST(R, v);
if(mst[L] == mst[R])
{
for(int i = L; i <= R; i++)
lazy[i] = L;
return;
}
int mid = (L + R) / 2;
vector<int> u;
MST(mid, v, 1);
for(int i : v)
if(use[i] || w[i] <= q[mid])
{
u.emplace_back(i);
use[i] = 0;
}
bs(L, mid, u);
u.clear();
MST(mid + 1, v, 1);
for(int i : v)
if(use[i] || w[i] >= q[mid + 1])
{
u.emplace_back(i);
use[i] = 0;
}
bs(mid + 1, R, u);
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> N >> M;
for(int i = 1; i <= M; i++)
cin >> E[i].F >> E[i].S >> w[i];
cin >> Q;
vector<int> v;
for(int i = 1; i <= M; i++)
v.emplace_back(i);
for(int i = 1; i <= Q; i++)
{
cin >> q[i];
lazy[i] = i;
}
bs(1, Q, v);
for(int i = 1; i <= Q; i++)
{
for(int j : mst[lazy[i]])
ans[i] += abs(q[i] - w[j]);
cout << ans[i] << '\n';
}
}
