#include <bits/stdc++.h>
using namespace std;
#define ii pair<int,int>
#define fi first
#define se second
#define endl '\n'
#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define rep(x,s,e) for (int x=(s)-((s)>(e));x!=(e)-((s)>(e));((s)<(e))?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct UFDS{
int p[505];
int r[505];
void reset(){ rep(x,0,505) p[x]=x,r[x]=0; }
int par(int i){
if (p[i]==i) return i;
else return p[i]=par(p[i]);
}
bool unions(int i,int j){
i=par(i),j=par(j);
if (i==j) return false;
if (r[i]<r[j]) swap(i,j);
p[i]=j;
if (r[i]==r[j]) r[j]++;
return true;
}
} ufds;
int n,m,q;
struct E{
int u,v;
int w;
};
E ee[100005];
int qu[1000005];
int split[1000005];
long long ans[1000005];
signed main(){
cin.tie(0);
cout.tie(0);
cin.sync_with_stdio(false);
cin>>n>>m;
rep(x,0,m) cin>>ee[x].u>>ee[x].v>>ee[x].w;
sort(ee,ee+m,[](E i,E j){
return i.w<j.w;
});
cin>>q;
rep(x,0,q) cin>>qu[x];
split[0]=0;
rep(x,0,q){
while (split[x]<m && ee[split[x]].w<=qu[x]) split[x]++;
split[x+1]=split[x];
}
rep(x,0,q){
ufds.reset();
int idx1=split[x]-1,idx2=split[x];
int num=0;
long long ans=0;
while (num<n-1){
if (idx2==m || (idx1!=-1 && qu[x]-ee[idx1].w<=ee[idx2].w-qu[x])){
if (ufds.unions(ee[idx1].u,ee[idx1].v)){
ans+=qu[x]-ee[idx1].w;
num++;
}
idx1--;
}
else{
if (ufds.unions(ee[idx2].u,ee[idx2].v)){
ans+=ee[idx2].w-qu[x];
num++;
}
idx2++;
}
}
cout<<ans<<endl;
}
}
