F. Maximum Weight Subset

#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=b;i>=a;i--)
#define pb push_back
const int M=250;
int deep[M],vis[M],a[M],b[M],k,n;
vector<int>g[M];
void dfs(int u,int f){
    deep[u]=deep[f]+1;
    for(int i=0;i<g[u].size();i++){
        int v=g[u][i];
        if(v!=f){
            dfs(v,u);
        }
    }
}
bool cmp(int x,int y){
    return deep[x]>deep[y];
}
struct node{
    int val,st;
};
int bfs(int st){
    queue<node>que;
    node s;
    s.val=st;
    s.st=0;
    que.push(s);
    memset(vis,0,sizeof(vis));
    int c=a[st];
    while(!que.empty()){
        node u=que.front();
        vis[u.val]=1;
        a[u.val]-=c;
        que.pop();
        if(u.st!=k){
            for(int i=0;i<g[u.val].size();i++){
                int v=g[u.val][i];
                if(!vis[v]){
                    node p;
                    p.val=v;
                    p.st=u.st+1;
                    que.push(p);
                }            
            }
        }
        
    }
    return c;
}
int main(){
    
    scanf("%d%d",&n,&k);
    fo(i,1,n)
        scanf("%d",&a[i]);
    fo(i,1,n-1){
        int x,y;
        scanf("%d%d",&x,&y);
        g[x].pb(y);
        g[y].pb(x);
    }
    dfs(1,0);
    fo(i,1,n)b[i]=i;
    sort(b+1,b+1+n,cmp);
    int ans=0;
    fo(i,1,n)
        if(a[i]>0)
            ans+=bfs(i);
    cout<<ans<<endl;
    return 0;
}