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 par[200010];
long long sum[200010], ans[200010], temp = 0;
struct A {
  int u, v, w;
} e[200010];
struct B {
  int l, r;
} g[200010];
bool cmp(A x, A y) { return x.w < y.w; }
bool cmp1(B x, B y) { return x.l < y.l; }
void init(int n) {
  for (int i = 0; i <= n; i++) {
    par[i] = i;
    sum[i] = 1;
  }
}
int fi(int x) {
  if (x != par[x]) {
    par[x] = fi(par[x]);
  }
  return par[x];
}
void un(int x, int y) {
  x = fi(x);
  y = fi(y);
  if (x != y) {
    temp -= (sum[x] * (sum[x] - 1) / 2);
    temp -= (sum[y] * (sum[y] - 1) / 2);
    par[x] = y;
    sum[y] += sum[x];
    temp += (sum[y] * (sum[y] - 1) / 2);
  }
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  init(n);
  for (int i = 1; i < n; i++) {
    scanf("%d %d %d", &e[i].u, &e[i].v, &e[i].w);
  }
  for (int i = 0; i < m; i++) {
    scanf("%d", &g[i].l);
    g[i].r = i;
  }
  sort(e + 1, e + n, cmp);
  sort(g, g + m, cmp1);
  int len = 1;
  for (int i = 0; i < m; i++) {
    while (g[i].l >= e[len].w && len < n) {
      un(e[len].u, e[len].v);
      len++;
    }
    ans[g[i].r] = temp;
  }
  for (int i = 0; i < m; i++) {
    printf("%I64d ", ans[i]);
  }
  return 0;
}