#include <bits/stdc++.h>
#define all(v) begin(v), end(v)
#define ii pair<int, int>
#define fi first
#define se second
#define siz(v) (int)(v).size()
#define lli pair<long long, int>
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(i) (1LL << (i))
#define dbg(x) "[" #x " = " << x << "]"
using namespace std;
const int MAXN = 1e5 + 6, MAXK = 105, infINT = 1e9 + 1321, mod = 1e9 + 7, base = 256;
const long long inf = 1e18 + 1231;
template<class X, class Y> bool minimize(X &x, const Y &y){return x > y ? x = y, 1: 0;}
template<class X, class Y> bool maximize(X &x, const Y &y){return x < y ? x = y, 1: 0;}
void add(int &a, const int &b){
a += b;
if (a >= mod) a -= mod;
}
void sub(int &a, const int &b){
a -= b;
if (a < 0) a += mod;
}
int mul(const int &a, const int &b){
return 1LL * a * 1LL * b % mod;
}
int bin_pow(int a, int k){
int res = 1;
while(k){
if (k & 1) res = mul(res, a);
k >>= 1; a = mul(a, a);
}
return res;
}
int numNode, numBread, val[MAXN];
long long f[MAXN][MAXK][2], sumAdj[MAXN];
vector<int > adj[MAXN];
void input(){
cin >> numNode >> numBread;
for(int i = 1; i <= numNode; i++){
cin >> val[i];
}
for(int i = 1; i < numNode; i++){
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
sumAdj[u] += val[v];
sumAdj[v] += val[u];
}
}
namespace sub2{
bool checkSub(){
return numNode <= 1000;
}
long long best = 0;
vector<array<int, 3> > can;
void dfs(int u, int par = 0){
for(int k = 0; k <= numBread; k++){
maximize(best, f[u][k][1]);
}
for(int v: adj[u]) if (v != par){
f[v][0][0] = f[u][0][0];
for(int k = 1; k <= numBread; k++){
maximize(f[v][k][0], max(f[u][k][0], f[u][k][1]));
maximize(f[v][k][1], max({f[u][k - 1][1] + (sumAdj[v] - val[u]),
f[par][k - 1][1] + (sumAdj[v] - val[u]),
f[u][k - 1][0] + (sumAdj[v] - val[u])}));
}
dfs(v, u);
}
for(int k = 0; k <= numBread; k++){
for(int i = 0; i < 2; i++) f[u][k][i] = -inf;
}
}
void solve(){
for(int u = 1; u <= numNode; u++){
f[u][0][0] = 0;
f[u][1][1] = sumAdj[u];
dfs(u);
for(array<int, 3> tmp: can) f[tmp[0]][tmp[1]][tmp[2]] = -inf;
can.clear();
}
cout << best << '\n';
}
}
namespace sub3{
bool checkSub(){
return 1;
}
long long best = 0;
void dfs(int u, int par = 0){
for(int k = 0; k <= numBread; k++){
maximize(best, f[u][k][1]);
}
for(int v: adj[u]) if (v != par){
f[v][0][0] = f[u][0][0];
for(int k = 1; k <= numBread; k++){
maximize(f[v][k][0], max(f[u][k][0], f[u][k][1]));
maximize(f[v][k][1], max({f[u][k - 1][1] + (sumAdj[v] - val[u]),
f[par][k - 1][1] + (sumAdj[v] - val[u]),
f[u][k - 1][0] + (sumAdj[v] - val[u])}));
}
dfs(v, u);
}
}
void solve(){
memset(f, -0x3f, sizeof f);
f[1][0][0] = 0;
f[1][1][1] = sumAdj[1];
dfs(1);
cout << best << '\n';
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define task "test"
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int t = 1;
// cin >> t;
while(t--){
input();
if (sub2::checkSub()) sub2::solve();
else if (sub3::checkSub()) sub3::solve();
}
cerr << (1.0 * clock()) / CLOCKS_PER_SEC << ".s\n";
}
