#include <bits/stdc++.h>

using namespace std;
#define int long long
const int p=998244353;
int po(int a,int b) {if(b==0) return 1; if(b==1) return a; if(b%2==0) {int u=po(a,b/2);return (u*1LL*u)%p;} else {int u=po(a,b-1);return (a*1LL*u)%p;}}
int inv(int x) {return po(x,p-2);}
mt19937 rnd;
#define app push_back
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(...) [](auto...a){ ((cout << a << ' '), ...) << endl;}(#__VA_ARGS__, ":", __VA_ARGS__)
#define debugv(v) do {cout<< #v <<" : {"; for(int izxc=0;izxc<v.size();++izxc) {cout << v[izxc];if(izxc+1!=v.size()) cout << ","; }cout <<"}"<< endl;} while(0)
#else
#define debug(...)
#define debugv(v)
#endif
#define lob(a,x) lower_bound(all(a),x)
#define upb(a,x) upper_bound(all(a),x)
const int maxn=1e5+5;
int par[maxn];
int get(int x)
{
    if(par[x]==(-1)) return x;
    int ans=get(par[x]);
    par[x]=ans;return ans;
}
void merg(int x,int y)
{
    x=get(x);y=get(y);if(x!=y) par[x]=y;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    fill(par,par+maxn,-1);
    int n,m;cin>>n>>m;
    vector<array<int,3> > v;
    for(int i=0;i<m;++i) {int x,y,w;cin>>x>>y>>w;v.app({w,x,y});}
    vector<int> que;
    int q;cin>>q;que.resize(q);for(int i=0;i<q;++i) cin>>que[i];
    auto que1=que;sort(all(que1));
    sort(all(v));int id=0;
    int cn=n;map<int,int> answ;
    for(int i=0;i<que1.size();++i)
    {
        while(id<v.size() && v[id][0]<=que1[i])
        {
            int x=get(v[id][1]),y=get(v[id][2]);
            if(x!=y) {--cn;par[x]=y;}
            ++id;
        }
        answ[que1[i]]=cn;
    }
    for(int i=0;i<que.size();++i)
    {
        cout<<answ[que[i]];if(i+1!=que.size()) cout<<'\n';
    }
    return 0;
}