#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <vector>

 using namespace std;

 const int maxn =  + ;

 const int maxk =  + ;

 int n, k;

 int a[maxn];

 int d[maxn][maxk][];

 vector<int> G[maxn];

 void dfs(int u, int fa)

 {

     for(int i = ; i < G[u].size(); i++)

     {

         int v = G[u][i];

         if(v == fa) continue;

         dfs(v, u);

         for(int j = k; j >= ; j--)

             for(int t = ; t <= j; t++)

             {

                 if(t > ) d[u][j][] = max(d[u][j][], d[u][j-t][] + d[v][t-][]);

                 if(t > ) d[u][j][] = max(d[u][j][], d[u][j-t][] + d[v][t-][]);

                 d[u][j][] = max(d[u][j][], d[u][j-t][] + d[v][t-][]);

             }

     }

 }

 int main()

 {

     while(scanf("%d%d", &n, &k) ==  && n)

     {

         for(int i = ; i <= n; i++) G[i].clear();

         memset(d, , sizeof(d));

         for(int i = ; i <= n; i++)

         {

             scanf("%d", a + i);

             for(int j = ; j <= k; j++) d[i][j][] = d[i][j][] = a[i];

         }

         for(int i = ; i < n; i++)

         {

             int u, v; scanf("%d%d", &u, &v);

             G[u].push_back(v); G[v].push_back(u);

         }

         dfs(, );

         printf("%d\n", max(d[][k][], d[][k][]));

     }

     return ;

 }