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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Iterator;
import java.io.BufferedWriter;
import java.util.Set;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.HashMap;
import java.util.TreeMap;
import java.util.Map;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        Task1213G solver = new Task1213G();
        solver.solve(1, in, out);
        out.close();
    }

    static class Task1213G {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();
            int m = in.nextInt();
            int mat[][] = new int[n - 1][3];
            int i;

            for (i = 0; i < n - 1; i++) {
                mat[i][0] = in.nextInt();
                mat[i][1] = in.nextInt();
                mat[i][2] = in.nextInt();
            }

            Arrays.sort(mat, (int o1[], int o2[]) -> {
                return o1[2] - o2[2];
            });

            TreeMap<Integer, Long> tm = new TreeMap<>();
            DisjointSet ds = new DisjointSet();

            for (i = 1; i <= n; i++)
                ds.makeSet(i);

            tm.put(0, 0l);
            for (i = 0; i < n - 1; i++) {
                Node a = ds.findSet(mat[i][0]);
                Node b = ds.findSet(mat[i][1]);
                long cur = 1l * a.size * b.size;
                tm.merge(mat[i][2], cur, (x, y) -> x + y);
                ds.union(mat[i][0], mat[i][1]);
            }

            //out.println(tm);

            long sum = 0;
            Iterator it = tm.keySet().iterator();

            while (it.hasNext()) {
                int key = (int) it.next();
                long val = tm.get(key);
                sum += val;
                tm.put(key, sum);
            }

            //out.println(tm);

            for (i = 0; i < m; i++) {
                int q = in.nextInt();
                long ans = tm.get(tm.floorKey(q));
                out.print(ans + " ");
            }
            out.println();
        }

        public class DisjointSet {
            private Map<Long, Node> map = new HashMap<>();

            public void makeSet(long data) {
                Node node = new Node();
                node.data = data;
                node.parent = node;
                node.rank = 1;
                node.size = 1;
                map.put(data, node);
            }

            public boolean union(long data1, long data2) {
                Node node1 = map.get(data1);
                Node node2 = map.get(data2);

                Node parent1 = findSet(node1);
                Node parent2 = findSet(node2);

                if (parent1.data == parent2.data) {
                    return false;
                } else {
                    parent2.parent = parent1;
                    parent1.rank += parent2.rank;
                    parent2.rank = 0;
                    parent1.size += parent2.size;
                    parent2.size = 0;
                }
                return true;
            }

            public Node findSet(long data) {
                return findSet(map.get(data));
            }

            private Node findSet(Node node) {
                Node parent = node.parent;
                if (parent == node) {
                    return parent;
                }
                node.parent = findSet(node.parent);
                return node.parent;
            }

        }

        class Node {
            long data;
            Node parent;
            int rank;
            long size;

        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void println() {
            writer.println();
        }

        public void close() {
            writer.close();
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}

