#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/dsu>

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m;
    cin>>n>>m;
    vector<ll> u(m),v(m),w(m);
    for(int i = 0;i<m;i++){
        cin>>u[i]>>v[i]>>w[i];
        //u[i]--;v[i]--;
    }
    vector<int> idx(m);
    for(int i = 0;i<m;i++) idx[i] = i;
    sort(idx.begin(),idx.end(),[&](int i,int j){
        return w[i] < w[j];
    });
    ll t;
    cin>>t;
    vector<ll> q(t);
    for(int i = 0;i<t;i++) cin>>q[i];
    vector<int> id(t);
    for(int i = 0;i<t;i++) id[i] = i;
    sort(id.begin(),id.end(),[&](int i,int j){
        return q[i] < q[j];
    });
    vector<int> ans(t,0);
    atcoder::dsu uf(n);
    int now = n;
    int ni = 0;
    for(int i = 0;i<t;i++){
        int nj = id[i];
        while(ni<m&&w[idx[ni]]<=q[nj]){
            int nk = idx[ni];
            if(!uf.same(u[nk],v[nk])) now--;
            uf.merge(u[nk],v[nk]);
            ni++;
        }
        ans[nj] = now;
    }
    for(int i = 0;i<t;i++) cout<<ans[i]<<endl;
}