Problem: Drazil and Varda are the earthworm couple. They want to find a good place to bring up their children. They found a good ground containing nature hole. The hole contains many rooms, some pairs of rooms are connected by small tunnels such that earthworm can move between them.

Let's consider rooms and small tunnels as the vertices and edges in a graph. This graph is a tree. In the other words, any pair of vertices has an unique path between them.

Each room that is leaf in the graph is connected with a ground by a vertical tunnel. Here, leaf is a vertex that has only one outgoing edge in the graph.

Each room is large enough only to fit one earthworm living in it. Earthworm can't live in a tunnel.

Drazil and Varda have a plan to educate their children. They want all their children to do morning exercises immediately after getting up!

When the morning is coming, all earthworm children get up in the same time, then each of them chooses the farthest path to the ground for gathering with others (these children are lazy, so they all want to do exercises as late as possible).

Drazil and Varda want the difference between the time first earthworm child arrives outside and the time the last earthworm child arrives outside to be not larger than l (otherwise children will spread around the ground and it will be hard to keep them exercising together).

Also, The rooms that are occupied by their children should form a connected set. In the other words, for any two rooms that are occupied with earthworm children, all rooms that lie on the path between them should be occupied with earthworm children too.

How many children Drazil and Varda may have at most in order to satisfy all conditions above? Drazil and Varda want to know the answer for many different choices of l.

(Drazil and Varda don't live in the hole with their children)

Input

The first line contains one integer n denoting how many rooms there are in the hole (2 ≤ n ≤ 105).

Then there are n - 1 lines following. Each of these lines contains three integers x, y, v (1 ≤ x, y ≤ n, 1 ≤ v ≤ 106) denoting there is a small tunnel between room x and room y that takes time v to pass. 

Suppose that the time for an earthworm to get out to the ground from any leaf room is the same.

The next line contains an integer q (1 ≤ q ≤ 50), denoting the number of different value of l you need to process.

The last line contains q numbers, each number denoting a value of l (1 ≤ l ≤ 1011).

Output

You should print q lines. Each line should contain one integer denoting the answer for a corresponding value of l.

Examples

Input

5
1 2 3
2 3 4
4 5 3
3 4 2
5
1 2 3 4 5


Output

1
3
3
3
5


Input

12
5 9 3
2 1 7
11 7 2
6 5 5
2 5 3
6 7 2
1 4 4
8 5 7
1 3 8
11 12 3
10 8 2
10
13 14 14 13 13 4 6 7 2 1


Output

10
10
10
10
10
3
3
5
2
1

Note

For the first sample the hole looks like the following. Rooms 1 and 5 are leaves, so they contain a vertical tunnel connecting them to the ground. The lengths of farthest path from rooms 1 – 5 to the ground are 12, 9, 7, 9, 12 respectively. 

If l = 1, we may only choose any single room. 

If l = 2..4, we may choose rooms 2, 3, and 4 as the answer. 

If l = 5, we may choose all rooms.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void testGen() {
  freopen("biginput1.txt", "w", stdout);
  fclose(stdout);
}
template <class T>
class WeightedTree {
  vector<vector<pair<int, T>>> adj;
  vector<pair<int, T>> p;
  vector<int> depth;
  int n;
  int root;

 public:
  vector<pair<int, T>> &getAdjacent(int u) { return adj[u]; }
  void reset(int size) {
    this->n = size;
    adj.resize(n + 1);
    for (auto i = 1; i <= n; ++i) adj[i].clear();
    p.resize(n + 1);
    depth.resize(n + 1);
    for (auto i = 1; i <= n; ++i) {
      p[i] = make_pair(-1, -1);
      depth[i] = 0;
    }
  }
  WeightedTree() {}
  WeightedTree(int n) { reset(n); }
  void dfs(int u) {
    for (auto &e : adj[u]) {
      int v = e.first;
      int c = e.second;
      if (p[v].first == -1) {
        p[v] = make_pair(u, c);
        depth[v] = depth[u] + 1;
        dfs(v);
      }
    }
  }
  int getParent(int u) { return p[u].first; }
  T getWeight(int u) { return p[u].second; }
  int getDepth(int u) { return depth[u]; }
  size_t getSize() { return n; }
  int getRoot() { return root; }
  void setRoot(int u) {
    for (auto v = 1; v <= n; ++v) {
      p[v].first = -1;
    }
    root = u;
    p[root].first = -2;
    dfs(root);
  }
  void addEdge(int u, int v, int c) {
    adj[u].push_back(make_pair(v, c));
    adj[v].push_back(make_pair(u, c));
  }
};
WeightedTree<int> tree;
vector<long long> dIn, dBest;
void dfs1(int u) {
  dIn[u] = 0;
  for (auto &v : tree.getAdjacent(u)) {
    if (v.first != tree.getParent(u)) {
      dfs1(v.first);
      dIn[u] = max(dIn[u], v.second + dIn[v.first]);
    }
  }
}
void dfs2(int u, long long dOut) {
  dBest[u] = max(dIn[u], dOut);
  int dInBest = -1, dInBest2 = -1;
  for (auto &v : tree.getAdjacent(u)) {
    if (v.first != tree.getParent(u)) {
      if (dInBest == -1 ||
          dIn[dInBest] + tree.getWeight(dInBest) <= dIn[v.first] + v.second) {
        dInBest2 = dInBest;
        dInBest = v.first;
      } else if (dInBest2 == -1 || dIn[dInBest2] + tree.getWeight(dInBest2) <
                                       dIn[v.first] + v.second) {
        dInBest2 = v.first;
      }
    }
  }
  for (auto &v : tree.getAdjacent(u)) {
    if (v.first != tree.getParent(u)) {
      long long bestOut = dOut + v.second;
      if (dInBest != -1) {
        if (dInBest != v.first) {
          bestOut =
              max(bestOut, v.second + dIn[dInBest] + tree.getWeight(dInBest));
        } else if (dInBest2 != -1) {
          bestOut =
              max(bestOut, v.second + dIn[dInBest2] + tree.getWeight(dInBest2));
        }
      }
      dfs2(v.first, bestOut);
    }
  }
}
vector<int> answer, exclude;
int finalAns;
vector<pair<long long, int>> ancestors;
long long l;
void dfsSolve(int u) {
  int leftIndex = 0, rightIndex = (int)ancestors.size() - 1, mid, final = -1;
  while (leftIndex <= rightIndex) {
    mid = (leftIndex + rightIndex) / 2;
    if (dBest[u] - ancestors[mid].first <= l) {
      rightIndex = mid - 1;
    } else {
      final = ancestors[mid].second;
      leftIndex = mid + 1;
    }
  }
  if (final != -1) {
    exclude[final]++;
  }
  answer[u] = 1;
  exclude[u] = 0;
  ancestors.push_back(make_pair(dBest[u], u));
  for (auto &v : tree.getAdjacent(u)) {
    if (v.first != tree.getParent(u)) {
      assert(dBest[u] <= dBest[v.first]);
      dfsSolve(v.first);
      answer[u] += answer[v.first];
    }
  }
  answer[u] -= exclude[u];
  finalAns = max(finalAns, answer[u]);
  ancestors.pop_back();
}
int main() {
  int n, x, y, v;
  cin >> n;
  tree.reset(n);
  for (auto repeat_var = 0; repeat_var < n - 1; ++repeat_var) {
    cin >> x >> y >> v;
    tree.addEdge(x, y, v);
  }
  tree.setRoot(1);
  dIn.resize(n + 1);
  dBest.resize(n + 1);
  dfs1(tree.getRoot());
  dfs2(tree.getRoot(), 0);
  int root = -1;
  for (auto u = 1; u <= n; ++u) {
    if (root == -1 || dBest[u] < dBest[root]) {
      root = u;
    }
  }
  tree.setRoot(root);
  int q;
  cin >> q;
  answer.resize(n + 1);
  exclude.resize(n + 1);
  for (auto repeat_var = 0; repeat_var < q; ++repeat_var) {
    cin >> l;
    finalAns = 0;
    dfsSolve(tree.getRoot());
    ancestors.clear();
    cout << finalAns << endl;
  }
  return 0;
}