#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 105;
int Case = 1, n, m;
int dp[maxn][maxn], cnt[maxn], w[maxn], res;
vector<int>ve[maxn];
int dfs(int u, int fa) {
	cnt[u] = 1;
	for(int i = 0; i < ve[u].size(); i++) {
		int v = ve[u][i];
		if(v == fa) continue;
		cnt[u] += dfs(v, u);
	}
	dp[u][1] = w[u];
	for(int i = 0; i < ve[u].size(); i++) {
		int v = ve[u][i];
		for(int j = cnt[u]; j >= 1; j--) {
			for(int k = 1; k < j && k <= cnt[v]; k++)
				dp[u][j] = max(dp[u][j], dp[u][j-k]+dp[v][k]);
		}
	}
	res = max(res, dp[u][m]);
	return cnt[u];
}
void solve() {
	res = 0;
    memset(dp, 0, sizeof(dp));
    for(int i = 0; i < maxn; i++) {
    	ve[i].clear();
    }
    for(int i = 0; i < n; i++) scanf("%d", &w[i]);
    for(int i = 1; i < n; i++) {
    	int u, v;scanf("%d%d", &u, &v);
    	ve[u].push_back(v);
    	ve[v].push_back(u);
    }
    dfs(0, -1);
    printf("%d\n", res);
    return;
}

int main() {
    while(scanf("%d%d", &n, &m) == 2) {
        solve();
    }
    return 0;
}