#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
    void add(X &x, const Y &y) {
        x = (x + y);
        if(x >= MOD) x -= MOD;
    }

template<class X, class Y>
    void sub(X &x, const Y &y) {
        x = (x - y);
        if(x < 0) x += MOD;
    }

/* Author : Le Ngoc Bao Anh, 11A5, LQD High School for Gifted Student*/

const ll INF = 1e18;
const int N = 1000 + 10;

vector<int> g[N];
int sz[N];
int w[N];
ll dp[N][N][3], ndp[N][N][3];

void dfs(int u, int par) {
    sz[u] = 1;
    dp[u][0][1] = w[u];
    for(auto v : g[u]) {
        if(v != par) {
            dfs(v, u);
            for(int x = 0; x <= sz[u]; x++) {
                for(int y = 0; y <= sz[v]; y++) {
                    maximize(ndp[u][x + y][0], dp[u][x][0] + dp[v][y][0]);
                    maximize(ndp[u][x + y][1], dp[u][x][1] + dp[v][y][0]);
                    maximize(ndp[u][x + y][1], dp[u][x][0] + dp[v][y][1] + w[u]);
                    maximize(ndp[u][x + y + 1][2], dp[u][x][1] + dp[v][y][1]);
                    maximize(ndp[u][x + y][2], dp[u][x][2] + dp[v][y][0]);
                }
            }
            sz[u] += sz[v];

            for(int i = 0; i <= sz[u]; i++) {
                for(int j = 0; j < 3; j++) {
                    dp[u][i][j] = ndp[u][i][j];
                    ndp[u][i][j] = -INF;
                }
            }
        }
    }

    for(int i = 0; i <= sz[u]; i++) {
        maximize(dp[u][i][0], dp[u][i][2]);
        maximize(dp[u][i + 1][0], dp[u][i][1]);
    }
}

void solve() {
    int n, k; cin >> n >> k;
    for(int i = 1; i <= n; i++) cin >> w[i];

    for(int i = 1; i < n; i++) {
        g[u].pb(v);
        int u, v; cin >> u >> v;
        g[v].pb(u);
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= n; j++) {
            for(int t = 0; t < 3; t++) dp[i][j][t] = ndp[i][j][t] = -INF;
        }
        dp[i][0][0] = ndp[i][0][0] = 0;
    }

    dfs(1, 0);
    ll ans = -INF;
    for(int i = 1; i <= n; i++) maximize(ans, dp[i][k][0]);

    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}