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>
import javax.annotation.processing.SupportedSourceVersion;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class F1249 {
    static List<Integer>gr[];
    static int a[];
    static int n;
    static int m;

    static int sum = 0;
    static int dp[][];
    static void dfs(int v, int parent){
        dp[v][0] = a[v];
        for (Integer e:gr[v]){
            if (e != parent){
                dfs(e, v);
            }
        }
        for (int depth = 0; depth < n; ++depth) {
            if (depth == 0){
                for (Integer e:gr[v]){
                    if (e!=parent){
                        dp[v][depth] += dp[e][Math.max(0, m-1)];
                    }
                }
            } else {
                for (Integer e:gr[v]){
                    if (e!=parent){
                        int cur = dp[e][depth-1];

                        for (Integer other:gr[v]){
                            if (other==parent || other==e){
                                continue;
                            }
                            cur += dp[other][Math.max(depth-1, m-depth-1)];
                        }
                        dp[v][depth] = Math.max(dp[v][depth], cur);
                    }
                }
            }
        }
        for (int depth=n-1; depth>0;--depth){
            dp[v][depth-1] = Math.max(dp[v][depth-1], dp[v][depth]);
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String in[] = br.readLine().trim().split(" ");
        n = Integer.parseInt(in[0]);
        m = Integer.parseInt(in[1]);
        ++m;

        gr = new ArrayList[n+1];
        a = new int[n+1];
        dp = new int[n+1][n+1];

        in =  br.readLine().trim().split(" ");

        for (int i=0;i<n;++i){
            a[i] = Integer.parseInt(in[i]);
            gr[i] = new ArrayList<>();
        }

        for (int i=0;i<n-1;++i){
            int u;
            int v;
            in =  br.readLine().trim().split(" ");
            u  = Integer.parseInt(in[0]);
            v = Integer.parseInt(in[1]);
            --u;
            --v;
            gr[u].add(v);
            gr[v].add(u);
        }
        dfs(0, -1);
        System.out.println(dp[0][0]);
    }
}
