#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define task "text"
#define int long long
struct DSU{
int lab[501];
void clea(){
memset(lab,-1,sizeof lab);
}
int findpar(int u){
if(lab[u]<0) return u;
return lab[u]=findpar(lab[u]);
}
bool unite(int u,int v){
u=findpar(u);
v=findpar(v);
if(u==v) return false;
if(lab[u]>lab[v]) swap(u,v);
lab[u] += lab[v];
lab[v] = u;
return true;
}
int connect(int u,int v){
return findpar(u) == findpar(v);
}
}dsu;
struct edge{
int u,v,w;
bool operator < (edge &oth) const{
return w < oth.w;
}
}e[100001];
const int N = 1e5+4;
int n,m,q;
int L[N],R[N];
struct eve{
int x,num,coff;
bool operator < (eve &oth) const{
return x < oth.x;
}
};
signed main(){
ios::sync_with_stdio(false);cin.tie(nullptr);
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
}
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>e[i].u>>e[i].v>>e[i].w;
}
sort(e+1,e+1+m);
//cerr<<1<<'\n';
for(int i=1;i<=m;i++){
dsu.clea();
for(int j=i-1;j>=1;j--){
dsu.unite(e[j].u,e[j].v);
if(dsu.connect(e[i].u,e[i].v)){
int w=(e[j].w+e[i].w)/2;
L[i]=w+1;
//if(i == 4) cerr<<w<<'\n';
break;
}
}
}
for(int i=m;i>=1;i--){
dsu.clea();
for(int j=i+1;j<=m;j++){
dsu.unite(e[j].u,e[j].v);
if(dsu.connect(e[i].u,e[i].v)){
int w=(e[i].w+e[j].w)/2;
R[i]=w;
break;
}
}
}
//cerr<<1<<'\n';
for(int i=1;i<=m;i++){
//cerr<<e[i].u<<' '<<e[i].v<<' '<<e[i].w<<'\n';
}
vector<eve> event;
for(int i=1;i<=m;i++){
if(R[i] == 0) R[i]=1e9;
event.push_back({L[i],-e[i].w,1});
event.push_back({e[i].w+1,+e[i].w,-1});
event.push_back({e[i].w+1,e[i].w,-1});
event.push_back({R[i]+1,-e[i].w,1});
}
sort(event.begin(),event.end());
int i=0;
int q;
cin>>q;
int sum=0,coff=0;
while(q--){
int x;
cin>>x;
while(i<event.size() && event[i].x <= x){
sum += event[i].num;
coff += event[i].coff;
i++;
}
int ans=x*coff+sum;
cout<<-ans<<'\n';
}
}
