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;
const unsigned long long base = 131;
const double PI = acos(-1.0);
const long double eps = 1e-7;
const int mod = 1e9 + 7;
const int M = 2e5 + 10;
int n, m, fa[M], siz[M];
long long int ans[M];
struct d1 {
  int x, y, z;
} a[M];
struct d2 {
  int q, id;
} b[M];
bool cmp1(d1 a, d1 b) { return a.z < b.z; }
bool cmp2(d2 a, d2 b) { return a.q < b.q; }
int fnd(int x) {
  if (fa[x] == x) return x;
  return fa[x] = fnd(fa[x]);
}
int main(int argc, char const *argv[]) {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n - 1; i++) scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].z);
  for (int i = 1; i <= m; i++) scanf("%d", &b[i].q), b[i].id = i;
  sort(a + 1, a + n, cmp1);
  sort(b + 1, b + 1 + m, cmp2);
  for (int i = 1; i <= n; i++) fa[i] = i, siz[i] = 1;
  int pos = 1;
  long long int cur = 0;
  for (int i = 1; i <= m; i++) {
    while (a[pos].z <= b[i].q && pos <= n - 1) {
      int t1 = fnd(a[pos].x), t2 = fnd(a[pos].y);
      cur += 1LL * siz[t1] * siz[t2];
      if (t2 > t1) swap(t1, t2);
      siz[t1] += siz[t2];
      fa[t2] = t1;
      pos++;
    }
    ans[b[i].id] = cur;
  }
  for (int i = 1; i <= m; i++) printf("%lld ", ans[i]);
  return 0;
}