#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, k, x, y, ia, ib, va, vb, ic, id;
bool flag = true;
vector<int> a, b;
vector<vector<int>> graph, dp, dpe;
void dfs(int i, int p) {
for(auto j : graph[i]) {
if(j != p) dfs(j, i);
}
//
y = 0;
for(int j = 0; j <= k; j++) {
ia = -1, ib = -1, va = 0, vb = 0, ic = -1, id = -1;
for(auto z : graph[i]) {
dp[i][j] = max(dp[i][j], max(dp[z][j], (j == k ? 0 : (z == p ? 0 : dp[z][j + 1]) + b[i] - (p == -1 ? 0 : a[p]))));
dpe[i][j] = max(dpe[i][j], max(dpe[z][j], (j == k ? 0 : (z == p ? 0 : dpe[z][j + 1]) + b[i] - (j + 1 == k ? 0 : a[z]))));
//
y = max(y, max(dp[i][j], (j == k ? 0 : (z == p ? 0 : dp[z][j + 1]) + b[i])));
y = max(y, dpe[i][j]);
//
int temp = max((z == p ? 0 : dpe[z][j]), (j == k ? 0 : (z == p ? 0 : dpe[z][j + 1]) + b[i] - a[z]));
if(ia == -1 || temp > va) {
ib = ia, vb = va, ia = z, va = temp;
} else if(ib == -1 || temp > vb) {
ib = z, vb = temp;
}
//
if(ic == -1 || dp[z][k - j] > dp[ic][k - j]) {
id = ic, ic = z;
} else if(id == -1 || dp[z][k - j] > dp[id][k - j]) {
id = z;
}
}
if(ia != ic && ia != -1 && ic != -1) y = max(y, va + dp[ic][k - j]);
if(ib != ic && ib != -1 && ic != -1) y = max(y, vb + dp[ic][k - j]);
if(ia != id && ia != -1 && id != -1) y = max(y, va + dp[id][k - j]);
}
x = max(x, y);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
a = vector<int>(n), b = vector<int>(n), graph = vector<vector<int>>(n);
int sum = 0, ind = 1;
for(int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
if(i != 0 && a[ind] > a[i]) {
ind = i;
}
}
//cout << sum - a[ind] << "\n";
for(int i = 0; i < n - 1; i++) {
cin >> x >> y;
x--, y--;
graph[x].push_back(y);
graph[y].push_back(x);
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < graph[i].size(); j++) b[i] += a[graph[i][j]];
}
//
dp = vector<vector<int>>(n, vector<int>(k + 1)), dpe = vector<vector<int>>(n, vector<int>(k + 1));
x = 0;
dfs(0, -1);
//
cout << x << "\n";
//cout << dpe[0][99] << " " << dpe[0][98] << " " << ind << " " << dpe[ind][99] << "\n";
//for(auto j : graph[ind]) cout << j << "\n";
}
