// #pragma GCC optimize("Ofast","unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n,m;
cin >> n >> m;
vector<pair<int,pair<int,int>>> edges(m);
for(auto&[a,b]:edges)cin>>b.first>>b.second>>a;
sort(edges.begin(),edges.end());
vector<set<pair<int,int>>> adj;
vector<int> replaces_front(m,-1);
{
// Calculation from the front
adj = vector<set<pair<int,int>>>(n+1);
int tar;
function<pair<bool,int>(int,int)> dfs = [&](int x,int p){
if(x==tar)return make_pair(true,(int)1e15);
for(auto[v,i]:adj[x])if(v!=p){
auto res = dfs(v,x);
if(res.first)return make_pair(true,min(res.second,i));
}
return make_pair(false,(int)0);
};
for(int i=0;i<m;i++){
tar = edges[i].second.second;
auto res = dfs(edges[i].second.first,-1);
if(res.first){
adj[edges[res.second].second.first].erase({edges[res.second].second.second,res.second});
adj[edges[res.second].second.second].erase({edges[res.second].second.first,res.second});
replaces_front[i] = res.second;
}
adj[edges[i].second.first].insert({edges[i].second.second,i});
adj[edges[i].second.second].insert({edges[i].second.first,i});
}
}
vector<int> replaces_back(m,-1);
{
// Calculation from the back
adj = vector<set<pair<int,int>>>(n+1);
int tar;
function<pair<bool,int>(int,int)> dfs = [&](int x,int p){
if(x==tar)return make_pair(true,(int)-1);
for(auto[v,i]:adj[x])if(v!=p){
auto res = dfs(v,x);
if(res.first)return make_pair(true,max(res.second,i));
}
return make_pair(false,(int)0);
};
for(int i=m-1;i>=0;i--){
tar = edges[i].second.second;
auto res = dfs(edges[i].second.first,-1);
if(res.first){
adj[edges[res.second].second.first].erase({edges[res.second].second.second,res.second});
adj[edges[res.second].second.second].erase({edges[res.second].second.first,res.second});
replaces_back[i] = res.second;
}
adj[edges[i].second.first].insert({edges[i].second.second,i});
adj[edges[i].second.second].insert({edges[i].second.first,i});
}
}
set<int> curr_left;
set<int> curr_right;
vector<pair<int,int>> curredgesl;
vector<pair<int,int>> curredgesr;
bool changed;
for(auto&i:adj)for(auto[a,b]:i)curr_right.insert(b);
for(int i:curr_right)curredgesr.emplace_back(0,i);
vector<bool> blacklist(m+3);
edges.emplace_back(-1e9,make_pair(0,0));
curr_left.insert(m);
curredgesl.emplace_back(0,m);
edges.emplace_back(2e9,make_pair(0,0));
curr_right.insert(m+1);
curredgesr.emplace_back(0,m+1);
auto solve = [&](int x){
if(changed){
curredgesl.clear();
for(int i:curr_left){
curredgesl.emplace_back(x-edges[i].first,i);
}
sort(curredgesl.begin(),curredgesl.end());
curredgesr.clear();
for(int i:curr_right){
curredgesr.emplace_back(edges[i].first-x,i);
}
sort(curredgesr.begin(),curredgesr.end());
} else {
for(auto&[c,i]:curredgesl)c=x-edges[i].first;
for(auto&[c,i]:curredgesr)c=edges[i].first-x;
}
for(auto[c,i]:curredgesl)blacklist[i+1]=false;
for(auto[c,i]:curredgesr)blacklist[i+1]=false;
auto iterl = curredgesl.begin();
auto iterr = curredgesr.begin();
long long ans = 0;
int cnt = 1;
while(cnt<n){
if(iterl->first<iterr->first){
if(!blacklist[iterl->second+1]){
ans+=iterl->first;
blacklist[replaces_back[iterl->second]+1]=true;
cnt++;
}
iterl++;
} else {
if(!blacklist[iterr->second+1]){
ans+=iterr->first;
blacklist[replaces_front[iterr->second]+1]=true;
cnt++;
}
iterr++;
}
}
return ans;
};
int iter = 0;
int q;
cin >> q;
for(int i=1;i<=q;i++){
int query;
cin >> query;
changed = false;
while(iter!=m and edges[iter].first<query){
curr_right.erase(iter);
if(replaces_back[iter]!=-1){
curr_right.insert(replaces_back[iter]);
}
curr_left.insert(iter);
if(replaces_front[iter]!=-1){
curr_left.erase(replaces_front[iter]);
}
iter++;
changed = true;
}
cout << solve(query) << '\n';
}
}
