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

const int N = 1e5+2;
const ll inf = 1e16;

int a[N],n,k;
ll dp[N][105],ans;
vector<int> g[N];

void dfs(int u,int p=0) {
    dp[u][1] = a[u];
    multiset<ll> v[k+1];
    for(auto x: g[u]) {
        if(x == p) continue;
        dfs(x,u);
        for(int i = 0; i <= k; i++) {
            v[i].insert(dp[x][i]);
        }
        for(int i = 1; i < k; i++) {
            dp[u][i+1] = max(dp[u][i+1],dp[x][i]+a[u]);
        }
    }
    ans = max(ans, dp[u][k]);
    for(auto x: g[u]) {
        if(x == p or g[u].size() < 3) continue;
        for(int j = 0; j < k; j++) {
            v[k - 1 - j].extract(dp[x][k - 1 - j]);
            ll mx = *v[k - 1 - j].rbegin();
            ll now = dp[x][j] + mx + a[u];
            ans = max(ans, now);
            v[k - 1 - j].insert(dp[x][k - 1 - j]);
        }
    }
}
void solve() {
    cin >> n >> k;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    for(int i = 1; i < n; i++) {
        int u,v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= k; j++) {
            dp[i][j] = -inf;
        }
    }
    dfs(1);
    cout << ans << '\n';
    return;
}

int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int tc = 1;
    // cin >> tc;
    for(int kase = 1; kase <= tc; kase++) {
        //cout << "Case " << kase << ": ";
        solve();
    }
    return 0;
}