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 java.io.*;
import java.util.*;

public class ProblemG {

    public static InputStream inputStream = System.in;

    public static OutputStream outputStream = System.out;

    public static void main(String[] args) {
        MyScanner scanner = new MyScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);

        int n = scanner.nextInt();
        int m = scanner.nextInt();
        List<Triple<Integer, Integer, Integer>> edges = new ArrayList<>();
        for (int i = 0; i < n - 1; i++) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();
            int w = scanner.nextInt();
            edges.add(new Triple<>(x, y, w));
        }

        Collections.sort(edges, Comparator.comparingInt(a -> a.third));

        List<Pair<Integer, Integer>> queries = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            queries.add(new Pair<>(scanner.nextInt(), i));
        }
        Collections.sort(queries, Comparator.comparingInt(a -> a.first));

        long[] ans = new long[m + 1];
        int index = 0;
        long s = 0;
        DSU dsu = new DSU(n);
        for (int i = 0; i < m; i++) {
            Pair<Integer, Integer> query = queries.get(i);
            while (index < n - 1 && edges.get(index).third <= query.first) {
                s = s + dsu.union(edges.get(index).first, edges.get(index).second);
                index++;
            }
            ans[query.second] = s;
        }


        for (int i = 0; i < m; i++) {
            out.print(ans[i] + " ");
        }


        out.flush();
    }

    private static class DSU {

        private Map<Integer, Node> nodes = new HashMap<>();

        private DSU(int n) {
            for (int i = 1; i <= n; i++) {
                nodes.put(i, new Node(i));
            }
        }

        private long union(int x, int y) {
            int xParent = find(x);
            int yParent = find(y);
            if (xParent == yParent) {
                return 0;
            }
            Node xNode = nodes.get(xParent);
            Node yNode = nodes.get(yParent);
            long s = (long) xNode.count * yNode.count;
            if (xNode.rank > yNode.rank) {
                yNode.parent = xNode.label;
                xNode.count += yNode.count;
            } else {
                if (xNode.rank == yNode.rank) {
                    yNode.rank++;
                }
                xNode.parent = yNode.label;
                yNode.count += xNode.count;
            }
            return s;
        }

        private int find(int n) {
            Node node = nodes.get(n);
            while (node.parent != node.label) {
                node = nodes.get(node.parent);
            }
            return node.label;
        }
    }

    private static class Node {

        private int parent;

        private int label;

        private int count;

        private int rank;

        private Node(int label) {
            this.label = label;
            this.parent = label;
            this.count = 1;
        }
    }

    private static class MyScanner {
        private BufferedReader bufferedReader;
        private StringTokenizer stringTokenizer;

        private MyScanner(InputStream inputStream) {
            bufferedReader = new BufferedReader(new InputStreamReader(inputStream));
        }

        private String next() {
            while (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {
                try {
                    stringTokenizer = new StringTokenizer(bufferedReader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return stringTokenizer.nextToken();
        }

        private int nextInt() {
            return Integer.parseInt(next());
        }

        private long nextLong() {
            return Long.parseLong(next());
        }

        private double nextDouble() {
            return Double.parseDouble(next());
        }

        private String nextLine() {
            String str = "";
            try {
                str = bufferedReader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    private static class Pair<F, S> {

        private F first;

        private S second;

        public Pair() {}

        public Pair(F first, S second) {
            this.first = first;
            this.second = second;
        }
    }

    private static class Triple<F, S, T> {

        private F first;

        private S second;

        private T third;

        public Triple() {}

        public Triple(F first, S second, T third) {
            this.first = first;
            this.second = second;
            this.third = third;
        }
    }
}
