#include <bits/stdc++.h>
using namespace std;

class UnionFind{
    public:
    vector<int> par,siz;
 
    void make(int N){
        par.resize(N,-1);
        siz.resize(N,1);
    }
 
    int root(int x){
        if(par.at(x) == -1) return x;
        else return par.at(x) = root(par.at(x));
    }
 
    void unite(int u, int v){
        u = root(u),v = root(v);
        if(u == v) return;
        if(siz.at(u) < siz.at(v)) swap(u,v);
 
        par.at(v) = u;
        siz.at(u) += siz.at(v);
    }
 
    bool issame(int u, int v){
        if(root(u) == root(v)) return true;
        else return false;
    }
};

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

    int N,M; cin >> N >> M;
    vector<vector<pair<int,int>>> Rs(100001);
    for(int i=0; i<M; i++){
        int u,v,w; cin >> u >> v >> w;
        Rs.at(w).push_back({u,v});
    }
    int T; cin >> T;
    vector<pair<int,int>> Ts(T);
    for(int i=0; i<T; i++) cin >> Ts.at(i).first,Ts.at(i).second = i;
    sort(Ts.begin(),Ts.end());
    vector<int> answer(T);

    int ans = N,nowr = 0;
    UnionFind Z; Z.make(N);
    for(auto [r,pos] : Ts){
        while(nowr <= r){
            for(auto [u,v] : Rs.at(nowr)){
                if(Z.issame(u,v)) continue;
                ans--;
                Z.unite(u,v);
            }
            nowr++;
        }
        answer.at(pos) = ans;
    } 
    for(auto a : answer) cout << a << endl;
}