#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 1e5 + 10, maxk = 1e2 + 10;
vector<int> grafo[maxn];
int n, k;
int gain[maxn], x[maxn], dp[maxn][maxk];
void dfs(int u, int p=0){
gain[u] = 0;
for(auto v : grafo[u]){
if(v == p) continue;
gain[u] += x[v];
dfs(v, u);
}
}
void solve(int u, int p=0){
for(int l=0;l<=k;l++)
dp[u][l] = 0;
for(auto v : grafo[u]){
if(v == p) continue;
solve(v, u);
for(int l=1;l<=k;l++)
dp[u][l] = max({dp[u][l], dp[v][l], dp[v][l-1] + gain[u]});
}
}
int32_t main(){
ios::sync_with_stdio(false), cin.tie(0);
cin >> n >> k;
for(int i=1;i<=n;i++)
cin >> x[i];
for(int i=1;i<n;i++){
int a, b;
cin >> a >> b;
grafo[a].push_back(b);
grafo[b].push_back(a);
}
int ans=0;
for(int i=1;i<=n;i++){
dfs(i);
solve(i);
// cout << "gain: " << gain[i] << "\n";
// cout << "dp: " << dp[i][k] << "\n";
ans = max(ans, dp[i][k]);
}
cout << ans << "\n";
return 0;
}
