Problem: You are given a weighted tree consisting of n vertices. Recall that a tree is a connected graph without cycles. Vertices u_i and v_i are connected by an edge with weight w_i.

You are given m queries. The i-th query is given as an integer q_i. In this query you need to calculate the number of pairs of vertices (u, v) (u < v) such that the maximum weight of an edge on a simple path between u and v doesn't exceed q_i.

Input

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 2 ⋅ 10^5) — the number of vertices in the tree and the number of queries.

Each of the next n - 1 lines describes an edge of the tree. Edge i is denoted by three integers u_i, v_i and w_i — the labels of vertices it connects (1 ≤ u_i, v_i ≤ n, u_i ≠ v_i) and the weight of the edge (1 ≤ w_i ≤ 2 ⋅ 10^5). It is guaranteed that the given edges form a tree.

The last line of the input contains m integers q_1, q_2, ..., q_m (1 ≤ q_i ≤ 2 ⋅ 10^5), where q_i is the maximum weight of an edge in the i-th query.

Output

Print m integers — the answers to the queries. The i-th value should be equal to the number of pairs of vertices (u, v) (u < v) such that the maximum weight of an edge on a simple path between u and v doesn't exceed q_i.

Queries are numbered from 1 to m in the order of the input.

Examples

Input


7 5
1 2 1
3 2 3
2 4 1
4 5 2
5 7 4
3 6 2
5 2 3 4 1


Output


21 7 15 21 3 


Input


1 2
1 2


Output


0 0 


Input


3 3
1 2 1
2 3 2
1 3 2


Output


1 3 3 

Note

The picture shows the tree from the first example: <image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int parent[200005], size[200005];
struct edge {
  int x, y, val;
  bool operator<(const edge& e) const { return val < e.val; }
} a[200005];
struct query {
  int id, val;
  bool operator<(const query& q) const { return val < q.val; }
} q[200005];
long long res[200005];
int find(int p) {
  if (p == parent[p]) return p;
  return parent[p] = find(parent[p]);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    parent[i] = i;
    size[i] = 1;
  }
  for (int i = 1; i < n; i++) {
    cin >> a[i].x >> a[i].y >> a[i].val;
  }
  sort(a + 1, a + n);
  for (int i = 1; i <= m; i++) {
    cin >> q[i].val;
    q[i].id = i;
  }
  sort(q + 1, q + 1 + m);
  int index = 1;
  long long ans = 0;
  for (int i = 1; i <= m; i++) {
    while (index < n && a[index].val <= q[i].val) {
      int x = a[index].x;
      int y = a[index].y;
      int rootx = find(x);
      int rooty = find(y);
      ans += (long long)size[rootx] * size[rooty];
      size[rootx] += size[rooty];
      parent[rooty] = rootx;
      index++;
    }
    res[q[i].id] = ans;
  }
  for (int i = 1; i <= m; i++) {
    cout << res[i];
    if (i == m)
      cout << '\n';
    else
      cout << ' ';
  }
  return 0;
}