#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10;
const double Pi = acos(-1);
inline long long read() {
  long long x = 0, f = 1, ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
  return x * f;
}
long long n, q;
long long cnt, head[N], deep[N];
struct Edge {
  long long to, nxt, dis;
} edge[N << 1];
inline void AddEdge(long long u, long long v, long long w) {
  edge[++cnt] = (Edge){v, head[u], w};
  head[u] = cnt;
  return;
}
void dfs(long long u, long long fa) {
  for (long long i = head[u], v; i; i = edge[i].nxt) {
    v = edge[i].to;
    if (v == fa) continue;
    deep[v] = deep[u] + edge[i].dis;
    dfs(v, u);
  }
  return;
}
long long dep[N], up[N][20];
void dfs1(long long u, long long fa) {
  dep[u] = dep[fa] + 1, up[u][0] = fa;
  for (long long i = 1; dep[u] >= (1 << i); ++i)
    up[u][i] = up[up[u][i - 1]][i - 1];
  for (long long i = head[u], v; i; i = edge[i].nxt) {
    v = edge[i].to;
    if (v == fa) continue;
    dfs1(v, u);
  }
  return;
}
inline long long LCA(long long u, long long v) {
  if (dep[u] < dep[v]) swap(u, v);
  for (register long long i = 19; i >= 0; --i)
    if (dep[up[u][i]] >= dep[v]) u = up[u][i];
  if (u == v) return u;
  for (register long long i = 19; i >= 0; --i)
    if (up[u][i] != up[v][i]) u = up[u][i], v = up[v][i];
  return up[u][0];
}
struct Node {
  long long f, id;
} nd[N];
long long F[N], siz[N];
long long GetF(long long x) { return F[x] == x ? x : F[x] = GetF(F[x]); }
void Merge(long long x, long long y) {
  x = GetF(x), y = GetF(y);
  if (x == y) return;
  if (siz[x] > siz[y]) swap(x, y);
  siz[y] += siz[x];
  F[x] = F[y];
  return;
}
long long f[N];
bool cmp(Node x, Node y) { return x.f < y.f; }
signed main() {
  n = read();
  for (register long long i = 2; i <= n; ++i) {
    long long a = read(), b = read(), w = read();
    AddEdge(a, b, w), AddEdge(b, a, w);
  }
  dfs(1, 0);
  long long L, R, mx = 0;
  for (register long long i = 1; i <= n; ++i)
    if (deep[i] > mx) mx = deep[i], L = i;
  deep[L] = 0, mx = 0, dfs(L, 0);
  for (register long long i = 1; i <= n; ++i)
    if (deep[i] > mx) mx = deep[i], R = i;
  dfs1(L, 0);
  for (register long long i = 1; i <= n; ++i) {
    nd[i].id = i;
    f[i] = nd[i].f = max(deep[i] + deep[L] - 2 * deep[LCA(i, L)],
                         deep[i] + deep[R] - 2 * deep[LCA(i, R)]);
  }
  q = read();
  sort(nd + 1, nd + n + 1, cmp);
  while (q--) {
    long long val = read();
    long long l = n + 1;
    for (register long long i = 1; i <= n; ++i) F[i] = i, siz[i] = 1;
    long long ans = 0;
    for (register long long r = n; r >= 1; --r) {
      while (nd[r].f - nd[l - 1].f <= val && l > 1) {
        --l;
        long long u = nd[l].id;
        for (long long i = head[u], v; i; i = edge[i].nxt) {
          v = edge[i].to;
          if (f[v] >= nd[l].f && f[v] <= nd[r].f)
            Merge(u, v), ans = max(ans, siz[GetF(u)]);
        }
      }
      --siz[GetF(nd[r].id)];
    }
    printf("%lld\n", max(1ll, ans));
  }
  return 0;
}
