#include<bits/stdc++.h>

using namespace std;

#define fi first

#define se second

#define mp make_pair

#define pb push_back

#define int long long

priority_queue<int>q[];

int n,m,Q,L,d[],rt,ans;

vector<pair<int,int> >v[];

inline void dfs(int x,int fa){

    for(int i=;i<v[x].size();i++)if(v[x][i].fi!=fa){

      int y=v[x][i].fi,z=v[x][i].se;d[y]=d[x]+z;dfs(y,x);

    }

}

inline void dfs2(int x,int fa,int sum){

    d[x]=max(d[x],sum);

    for(int i=;i<v[x].size();i++)if(v[x][i].fi!=fa){

      int y=v[x][i].fi,z=v[x][i].se;dfs2(y,x,sum+z);

    }

}

inline void mer(priority_queue<int> &x,priority_queue<int> &y){

    if((int)y.size()>(int)x.size())swap(x,y);while(!y.empty())x.push(y.top()),y.pop();

}

inline void go(int x,int fa){

    for(int i=;i<v[x].size();i++)if(v[x][i].fi!=fa){

      int y=v[x][i].fi,z=v[x][i].se;go(y,x);mer(q[x],q[y]);

      while(!q[x].empty())if(q[x].top()-d[x]>L)q[x].pop();else break;

    }

    ans=max(ans,(int)q[x].size());return;

}

signed main(){

    int i,j,k;rt=;

    scanf("%lld",&n);

    for(i=;i<n;i++){

      int x,y,z;

      scanf("%lld%lld%lld",&x,&y,&z);

      v[x].pb(mp(y,z));

      v[y].pb(mp(x,z));

    }

    dfs(rt,);for(i=;i<=n;i++)if(d[i]>d[rt])rt=i;

    memset(d,,sizeof(d));dfs(rt,);int ano=rt;

    for(i=;i<=n;i++)if(d[i]>d[ano])ano=i;dfs2(ano,,);

    for(i=;i<=n;i++)if(d[i]<d[rt])rt=i;

    scanf("%lld",&Q);

    while(Q--){

      for(i=;i<=n;i++){while(!q[i].empty())q[i].pop();q[i].push(d[i]);}

      scanf("%lld",&L);ans=;go(rt,);printf("%lld\n",ans);

    }

    return ;

}