#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10, M = 2e5 + 10;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
int n, c, val[N], h[N], e[M], ne[M], idx;
inline void add(int a, int b) {e[idx] = b, ne[idx] = h[a], h[a] = idx ++; }

long long sum[N], f[N][105][2], g[N][105][2], ans;
void dfs(int u, int fa) {
    for(int i = h[u]; i != -1; i = ne[i]) {
        int v = e[i]; if(v == fa) continue;
        sum[u] += val[v], dfs(v, u);
    }
    f[u][0][1] = g[u][0][1] = -INF;
    g[u][1][1] = val[fa] + sum[u];
    for(int i = h[u]; i != -1; i = ne[i]) {
        int v = e[i]; if(v == fa) continue;
        long long maxv[2] = {0ll, 0ll};
        for(int j = c; j >= 0; j --) {
            maxv[0] = max({maxv[0], g[u][c - j][0], g[u][c - j][1]});
            maxv[1] = max({maxv[1], f[u][c - j][0], f[u][c - j][1] + val[fa] - val[v]});
            ans = max({ans, f[v][j][0] + maxv[0], f[v][j][1] + maxv[0]});
            ans = max({ans, g[v][j][0] + maxv[1], g[v][j][1] + maxv[1]});
        }
        for(int j = 1;j <= c; j ++) {
            f[u][j][0] = max({f[u][j][0], f[v][j][0], f[v][j][1]});
            f[u][j][1] = max({f[u][j][1], f[v][j - 1][0] + sum[u], f[v][j - 1][1] + sum[u]});
        }
        for(int j = 1; j <= c; j ++) {
            g[u][j][0] = max({g[u][j][0], g[v][j][0], g[v][j][1]});
            g[u][j][1] = max({g[u][j][1], g[v][j - 1][0] + sum[u] + val[fa] - val[v], g[v][j - 1][1] + sum[u] + val[fa] - val[v]});
        }
    }
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    memset(h, -1, sizeof h);

    cin >> n >> c;
    if(c == 0) {cout << "0\n"; return 0; }
    for(int i = 1; i <= n; i ++) cin >> val[i];
    for(int i = 1; i < n; i ++) {
        int a, b; cin >> a >> b;
        add(a, b), add(b, a);
    }
    dfs(1, 0); cout << ans << '\n';

    return 0;
}