#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;


struct union_find{
    vector<int> par;
    vector<int> siz;
    
    union_find(int n) : par(n), siz(n, 1){
        for(int i=0; i<n; i++) par[i] = i;
    }
    
    int root(int x){
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }
 
    void unite(int x, int y){
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return;
        if (siz[rx] < siz[ry]) swap(rx, ry);
        siz[rx] += siz[ry];
        par[ry] = rx;
    }
 
    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
 
    int size(int x){
        return siz[root(x)];
    }
};


void solve(){
    int n, m; cin >> n >> m;
    vector<vector<pair<int, int>>> es(1e5+2);
    vector<vector<int>> T(1e5+1);
    for(int i=0; i<m; i++){
        int u, v, w; cin >> u >> v >> w;
        es[w].pb({u, v});
    }
    int q; cin >> q;
    for(int i=0; i<q; i++){
        int r; cin >> r;
        T[r].pb(i);
    }

    vector<int> ans(q);
    union_find uf(n);
    int con = n;
    for(int i=0; i<=1e5; i++){
        for(auto [u, v] : es[i]){
            if(!uf.same(u, v)){
                con--;
                uf.unite(u, v);
            }
        }
        for(int j : T[i]) ans[j] = con;
    }

    for(int i=0; i<q; i++) cout << ans[i] << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}