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>
from operator import itemgetter
import sys
input = sys.stdin.readline


class UnionFind:
    def __init__(self, n):
        self.parent = [-1] * n
        self.cnt = n

    def root(self, x):
        if self.parent[x] < 0:
            return x
        else:
            self.parent[x] = self.root(self.parent[x])
            return self.parent[x]

    def merge(self, x, y):
        x = self.root(x)
        y = self.root(y)
        if x != y:
            if self.parent[x] > self.parent[y]:
                x, y = y, x
            self.parent[x] += self.parent[y]
            self.parent[y] = x
            self.cnt -= 1

    def is_same(self, x, y):
        return self.root(x) == self.root(y)

    def get_size(self, x):
        return -self.parent[self.root(x)]

    def get_cnt(self):
        return self.cnt


n, m = map(int, input().split())
info = [list(map(int, input().split())) for i in range(n - 1)]
q = list(map(int, input().split()))
info = sorted(info, key = itemgetter(2))
ans = [0] * (2*10**5)
uf = UnionFind(2*10**5)
info_i = 0
for i in range(2*10**5):
    if i-1 >= 0:
        ans[i] = ans[i-1]
    while True:
        if info_i >= n - 1:
           break
        if info[info_i][2] == i + 1:
            a, b, _ = info[info_i]
            a -= 1
            b -= 1
            num_a = uf.get_size(a)
            num_b = uf.get_size(b)
            num_ab = num_a + num_b
            comb_num_a = (num_a*(num_a-1)) // 2
            comb_num_b = (num_b*(num_b-1)) // 2
            comb_num_ab = (num_ab*(num_ab-1)) // 2
            ans[i] += comb_num_ab - (comb_num_a + comb_num_b)
            uf.merge(a, b)
            info_i += 1
        else:
            break

res = [0] * len(q)
for i, j in enumerate(q):
    res[i] = ans[j - 1]
print(*res)