#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<P> vp;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define fi first
#define se second
#define rsort(a) {sort(all(a));reverse(all(a));}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> bool chmax(T&a, T b){if(a<b){a=b;return true;}return false;}
vi sol1(ll n,vvi g,vi v){
    vector<deque<ll>> dp(n);
    vi dp_val(n);
    auto dfs=[&](auto && self, ll i,ll p) -> void {
        ll ma=-1;
        for(ll x:g[i])if(x!=p){
            self(self,x,i);
            if(ma==-1||dp_val[ma]<dp_val[x])ma=x;
        }
        if(ma!=-1){
            swap(dp[ma],dp[i]);
            dp_val[i]=dp_val[ma];
        }
        dp[i].pb(i);
        dp_val[i]+=v[i];
    };dfs(dfs,0,-1);
    vi res;
    for(auto x:dp[0])res.pb(x);
    reverse(all(res));
    return res;
}
vi sol2(ll n,vvi g,vi v){
    vp optim1(n);
    vi optim2(n);
    vvi optim3(n,vi(3));
    vi dp1_val(n),dp2_val(n),dp3_val(n);
    vvi ch(n);
    vi dep(n),par(n);
    auto dfs=[&](auto && self, ll i,ll p,ll d) -> void {
        dep[i]=d;par[i]=p;
        vp srt1,srt2,srt3;
        ll sum=0;
        for(ll x:g[i])if(x!=p){
            ch[i].pb(x);
            self(self,x,i,d+1);
            srt1.pb(dp1_val[x]-v[x],x);
            srt2.pb(dp2_val[x]-v[x],x);
            srt3.pb(dp3_val[x]-v[x],x);
            sum+=v[x];
        }
        rsort(srt1);rsort(srt2);rsort(srt3);
        if(srt1.size()==0){
            dp1_val[i]=dp2_val[i]=v[i];
        }
        else{
            if(srt1.size()==1){
                dp1_val[i]=srt1[0].fi+sum+v[i];
            }
            else{
                if(srt1[0].se!=srt2[0].se)optim1[i]=P(srt2[0].se,srt1[0].se);
                else if(srt1[0].fi+srt2[1].fi>srt1[1].fi+srt2[0].fi)optim1[i]=P(srt2[1].se,srt1[0].se);
                else optim1[i]=P(srt2[0].se,srt1[1].se);
                dp1_val[i]=v[i]+sum+(dp2_val[optim1[i].fi]-v[optim1[i].fi])+(dp1_val[optim1[i].se]-v[optim1[i].se]);
                P tmp;
                if(srt3[0].se!=srt2[0].se)tmp=P(srt2[0].se,srt3[0].se);
                else if(srt3[0].fi+srt2[1].fi>srt3[1].fi+srt2[0].fi)tmp=P(srt2[1].se,srt3[0].se);
                else tmp=P(srt2[0].se,srt3[1].se);
                dp3_val[i]=v[i]+sum+(dp2_val[tmp.fi]-v[tmp.fi])+(dp3_val[tmp.se]-v[tmp.se]);
                optim3[i]=vi{tmp.fi,tmp.se,-1};
            }
            optim2[i]=srt2[0].se;
            dp2_val[i]=v[i]+sum+srt2[0].fi;
        }
        if(srt1.size()>2){
            rep(a,3)rep(b,3)REP(c,b+1,3)if(srt2[a].se!=srt3[b].se&&srt2[a].se!=srt3[c].se){
                vi noptim={srt2[a].se,srt3[b].se,srt3[c].se};
                if(chmax(dp3_val[i],v[i]+sum+srt2[a].fi+srt3[b].fi+srt3[c].fi))optim3[i]=noptim;
            }
        }
        for(ll c:ch[i]){
            if(chmax(dp1_val[i],v[i]+dp3_val[c]))optim1[i]=P(c,-1);
        }
    };dfs(dfs,0,-1,0);
    vvi dp(n);
    auto sol=[&](auto && self, ll i, ll t) -> void {
        if(ch[i].size()==0){
            dp[i].pb(i);return;
        }
        if(t==1){
            if(optim1[i].se==-1){
                ll c=optim1[i].fi;
                self(self,optim1[i].fi,3);
                dp[i].pb(i);
                for(ll x:dp[optim1[i].fi])dp[i].pb(x);
                return;
            }
            if(ch[i].size()==1){
                self(self,ch[i][0],1);
                dp[i].pb(i);
                for(auto x:dp[ch[i][0]])dp[i].pb(x);
                return;
            }
            self(self,optim1[i].fi,2);
            self(self,optim1[i].se,1);
            dp[i].pb(i);
            for(ll x:dp[optim1[i].fi])dp[i].pb(x);
            for(ll c:ch[i])if(c!=optim1[i].fi&&c!=optim1[i].se)dp[i].pb(c);
            for(ll x:dp[optim1[i].se])dp[i].pb(x);
        }
        if(t==2){
            self(self,optim2[i],2);
            for(ll c:ch[i])if(c!=optim2[i])dp[i].pb(c);
            reverse(all(dp[optim2[i]]));
            for(ll x:dp[optim2[i]])dp[i].pb(x);
            dp[i].pb(i);
        }
        if(t==3){
            if(optim3[i][2]==-1){
                self(self,optim3[i][0],2);
                self(self,optim3[i][1],3);
                reverse(all(dp[optim3[i][0]]));
                for(ll x:ch[i])if(x!=optim3[i][0]&&x!=optim3[i][1])dp[i].pb(x);
                for(ll x:dp[optim3[i][0]])dp[i].pb(x);
                dp[i].pb(i);
                for(ll x:dp[optim3[i][1]])dp[i].pb(x);
                return;
            }
            else{
                self(self,optim3[i][0],1);
                self(self,optim3[i][1],2);
                self(self,optim3[i][2],2);
                reverse(all(dp[optim3[i][2]]));
                for(ll x:ch[i])if(x!=optim3[i][0]&&x!=optim3[i][1]&&x!=optim3[i][2])dp[i].pb(x);
                for(ll x:dp[optim3[i][2]])dp[i].pb(x);
                dp[i].pb(i);
                for(ll x:dp[optim3[i][1]])dp[i].pb(x);
                for(ll x:dp[optim3[i][0]])dp[i].pb(x);
                return;
            }
        }
    };sol(sol,0,1);
    auto dis=[&](ll a,ll b){
        ll res=0;
        while(a!=b){
            if(dep[a]>dep[b])a=par[a];
            else b=par[b];
            res++;
        }
        return res;
    };
    vi res;
    res=dp[0];
    ll sum=0;
    for(ll x:res)sum+=v[x];
    // outv(res);
    // out(dp1_val[0]);
    assert(sum==dp1_val[0]);
    rep(i,res.size()-1)assert(dis(res[i],res[i+1])<=2);
    vi tmp=res;
    sort(all(tmp));
    rep(i,tmp.size()-1)assert(tmp[i]<tmp[i+1]);
    return res;
}
vi sol3(ll n,vvi g,vi v){
    vi res;
    auto dfs=[&](auto && self, ll i,ll p) -> void {
        res.pb(i);
        for(ll x:g[i])if(x!=p){
            for(ll y:g[x])if(y!=i)self(self,y,x);
            res.pb(x);
        }
    };dfs(dfs,0,-1);
    return res;
}
int main(){
    ll n,K;cin>>n>>K;
    vvi g(n);
    rep(i,n-1){
        ll a,b;cin>>a>>b;a--;b--;
        g[a].pb(b);g[b].pb(a);
    }
    vi v(n);rep(i,n)cin>>v[i];
    vi res;
    if(K==1)res=sol1(n,g,v);
    if(K==2)res=sol2(n,g,v);
    if(K==3)res=sol3(n,g,v);
    ll sum=0;
    for(ll x:res)sum+=v[x];
    for(ll&x:res)x++;
    out(sum);
    out(res.size());
    outv(res);
}