#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 505;
const int M = 505;
const ll INF = 0x3f3f3f3f3f3f3f3f;

ll dp[N][M][2];
vector<int> G[N];
int a[N];
int n, m;

void dfs(int u, int par) {
    for (int i = 0; i <= m; i++) {
        dp[u][i][0] = dp[u][i][1] = -INF;
    }
    dp[u][1][0] = a[u];
    dp[u][1][1] = a[u];

    for (int v : G[u]) {
        if (v == par) continue;
        dfs(v, u);
        vector<vector<ll>> temp(m + 1, vector<ll>(2, -INF));
        for (int i = 0; i <= m; i++) {
            temp[i][0] = dp[u][i][0];
            temp[i][1] = dp[u][i][1];
        }
        for (int i = 0; i <= m; i++) {
            for (int j = 0; j <= m; j++) {
                if (i + j + 2 <= m) {
                    if (temp[i][0] != -INF && dp[v][j][0] != -INF) {
                        ll candidate = temp[i][0] + dp[v][j][0];
                        if (candidate > dp[u][i + j + 2][0]) {
                            dp[u][i + j + 2][0] = candidate;
                        }
                    }
                }
                if (i + j + 1 <= m) {
                    if (temp[i][0] != -INF && dp[v][j][1] != -INF) {
                        ll candidate = temp[i][0] + dp[v][j][1];
                        if (candidate > dp[u][i + j + 1][1]) {
                            dp[u][i + j + 1][1] = candidate;
                        }
                    }
                }
            }
        }
    }
}

int main() {
    freopen("food.in", "r", stdin);
    freopen("food.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    for (int i = 1; i < n; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(1, 0);
    ll ans = 0;
    for (int t = 1; t <= m; t++) {
        ans = max(ans, dp[1][t][0]);
        ans = max(ans, dp[1][t][1]);
    }
    printf("%lld\n", ans);
    return 0;
}