// Authored by Ibrahimfostok...
// Next level : "Master"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
// const ll mod = 1e9 + 7;
#define gcd __gcd
#define int ll
#define ld long double
#define lcm(a, b) (a * b / gcd(a, b))
#define ceil(x, y) (((x) + (y) - 1ll) / (y))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define MOD(x) x = ((x % mod) + mod) % mod
const long double pi = 3.14159265358979323846;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll L, ll R)
{
    return uniform_int_distribution<ll>(L, R)(rng);
}
//
int n, k, ans;
vector<int> a;
map<array<int, 3>, int> dp;
int dfs(int u, int p, int need, vector<vector<int>> &adj)
{
    if (dp.find({u, p, need}) != dp.end())
        return dp[{u, p, need}];
    if (need == 0)
        return a[u];
    int mx = -1e18;
    for (auto &y : adj[u])
    {
        if (y == p)
            continue;
        int h = dfs(y, u, need - 1, adj);
        dp[{y, u, need - 1}] = h;
        mx = max(mx, h);
    }
    int val = (mx != 1e18 ? mx + a[u] : -1e18);
    if (need == k - 1)
        ans = max(ans, val);
    return dp[{u, p, need}] = val;
}
void My_Solve(int TC)
{
    // cout << setprecision(10) << fixed;
    cin >> n >> k, ans = 0;
    a.clear(), a.resize(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    vector<vector<int>> adj(n);
    for (int i = 0; i < n - 1; i++)
    {
        int u, v;
        cin >> u >> v;
        adj[--u].pb(--v), adj[v].pb(u);
    }
    for (int i = 0; i < n; i++)
        dfs(i, -1, k - 1, adj);
    cout << ans << '\n';
}
int32_t main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++)
        My_Solve(i);
    return 0;
}