#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-12;
const int inf = 2000000000;
const long long int infLL = (long long int)1e18;
long long int MOD = 1000000007;
int MOD1 = 1000000007;
int MOD2 = 1000000009;
inline bool checkBit(long long int n, long long int i) {
  return n & (1LL << i);
}
inline long long int setBit(long long int n, long long int i) {
  return n | (1LL << i);
  ;
}
inline long long int resetBit(long long int n, long long int i) {
  return n & (~(1LL << i));
}
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long int year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long int &a) {
  a %= MOD;
  (a < 0) && (a += MOD);
}
inline long long int modMul(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a * b) % MOD;
}
inline long long int modAdd(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  return (a + b) % MOD;
}
inline long long int modSub(long long int a, long long int b) {
  a %= MOD, b %= MOD;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long int modPow(long long int b, long long int p) {
  long long int r = 1LL;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1LL;
  }
  return r;
}
inline long long int modDiv(long long int a, long long int b) {
  return modMul(a, modPow(b, MOD - 2));
}
bool comp(const pair<long long int, pair<long long int, long long int> > &p1,
          const pair<long long int, pair<long long int, long long int> > &p2) {
  return p1.first > p2.first;
}
bool comp1(const pair<long long int, long long int> &p1,
           const pair<long long int, long long int> &p2) {
  if (p1.first == p2.first) {
    return p1.second > p2.second;
  }
  return p1.first < p2.first;
}
long long int converter(string a) {
  long long int i, mul = 1LL, r, t, ans = 0LL;
  if (a.length() == 0) return 0;
  for (i = a.length() - 1; i >= 0; i--) {
    t = a[i] - '0';
    r = t % 10;
    ans += (mul * r);
    mul = mul * 10;
  }
  return ans;
}
int msb(unsigned x) {
  union {
    double a;
    int b[2];
  };
  a = x;
  return (b[1] >> 20) - 1023;
}
const int MAX = 100005;
vector<pair<long long int, long long int> > adj[MAX];
long long int d1[MAX], d2[MAX], d3[MAX], d[MAX], n;
int b[MAX], f[MAX], timer;
long long int ans;
long long int dpCnt[MAX];
vector<int> parList;
void dfs(int u, int fa) {
  for (int i = 0; i < adj[u].size(); i++) {
    long long int v = adj[u][i].first;
    long long int w = adj[u][i].second;
    if (v == fa) continue;
    dfs(v, u);
    if (d1[v] + w >= d1[u]) {
      d2[u] = d1[u];
      d1[u] = d1[v] + w;
    } else if (d1[v] + w > d2[u])
      d2[u] = d1[v] + w;
  }
}
void dfs2(int u, int fa) {
  for (int i = 0; i < adj[u].size(); i++) {
    long long int v = adj[u][i].first;
    long long int w = adj[u][i].second;
    if (v == fa) continue;
    if (d1[v] + w > d2[u])
      d3[v] = max(d3[u], d2[u]) + w;
    else
      d3[v] = max(d3[u], d1[u]) + w;
    dfs2(v, u);
  }
}
void dfs3(int u, int p, long long int lim) {
  dpCnt[u] = 1;
  parList.push_back(u);
  int low = 0, high = parList.size() - 1, mid, idx = -1;
  while (low <= high) {
    mid = (low + high) >> 1;
    if (d[u] - d[parList[mid]] <= lim)
      idx = mid, high = mid - 1;
    else
      low = mid + 1;
    ;
  }
  --idx;
  if (idx != -1) dpCnt[parList[idx]]--;
  for (auto it : adj[u])
    if (it.first != p) {
      long long int v = it.first;
      dfs3(v, u, lim);
      dpCnt[u] += dpCnt[v];
    };
  ans = max(ans, dpCnt[u]);
  parList.pop_back();
}
long long int call(long long int x, int rot) {
  ans = 0LL;
  memset(dpCnt, 0, sizeof(dpCnt));
  dfs3(rot, 0, x);
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cout.unsetf(ios::floatfield);
  cout.precision(20);
  cout.setf(ios::fixed, ios::floatfield);
  ;
  long long int x, y, z, q;
  cin >> n;
  for (int i = 1; i < n; ++i) {
    cin >> x >> y >> z;
    adj[x].push_back(pair<long long int, long long int>(y, z));
    adj[y].push_back(pair<long long int, long long int>(x, z));
  }
  dfs(1, 1), dfs2(1, 1);
  long long int mini = infLL, idx;
  for (int i = 1; i <= n; i++) {
    d[i] = max(d1[i], d3[i]);
    if (d[i] < mini) idx = i, mini = d[i];
  }
  dfs(idx, 0);
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    cin >> x;
    cout << call(x, idx) << '\n';
  }
  return 0;
}
