#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
    /*
    int n,q;
    cin>>n>>q;
    if(n>2000||q>2000)return 0;
    vector<int>c(n);
    for(auto&e:c)cin>>e;
    while(q--){
        //debug(q);
        int l,d;cin>>l>>d;
        c[l-1]+=d;
        map<int,int>mp;
        for(int i=0;i<n;i++)if(c[i]&1)mp[i]=1;
        int idx=0;
        auto cnt=c;
        long long ans=0;
        for(auto&e:cnt)e/=2;
        for(int i=n-1;i>=0;i--){
            while(cnt[i]&&mp.size()){
                auto it=mp.rbegin();
                if(it->first>=2*i+1){
                    mp.erase(--mp.end());
                }
                else{
                    if(cnt[i]<it->second){
                        mp[it->first]-=cnt[i];
                        ans+=cnt[i];
                        cnt[i]=0;
                    }
                    else{
                        cnt[i]-=it->second;
                        ans+=it->second;
                        mp.erase(--mp.end());
                    }
                }
            }
            while(cnt[i]&&idx<i){
                if(cnt[i]>2*cnt[idx]){
                    cnt[i]-=2*cnt[idx];
                    ans+=2*cnt[idx];
                    cnt[idx]=0;
                    idx++;
                }
                else{
                    cnt[idx]-=(cnt[i]+1)/2;
                    ans+=cnt[i];
                    cnt[i]=0;
                    if(cnt[i]&1)mp[idx]++;
                }
            }
            if(idx==i&&cnt[i]){
                int x=(cnt[i]+2)/3;
                ans+=cnt[i]-x;
                mp[i]+=2*x-(cnt[i]-x);
            }
        }
        cout<<ans<<endl;
    }*/
    int n,k;
    cin>>n>>k;
    vector<vector<int>>g(n);
    for(int i=0;i<n-1;i++){
        int u,v;cin>>u>>v;
        u--,v--;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    vector<ll>p(n);
    for(auto&e:p)cin>>e;
    
    if(k==1){
        vector<ll>dp(n,0);
        auto dfs=[&](auto&&f,int u,int par=-1)->ll {
            ll tmp=0;
            for(auto v:g[u])if(v!=par){
                tmp=max(tmp,f(f,v,u));
            }
            dp[u]=tmp+p[u];
            return dp[u];
        };
        cout<<dfs(dfs,0)<<endl;
        int now=0;
        vector<int>ans={0};
        while(true){
            for(auto u:g[now])if(dp[u]==dp[now]-p[now]){
                ans.emplace_back(u);
                if(g[u].size()==1)goto home;
                now=u;
                break;
            }
        }
        home:
        for(auto&e:ans)e++;
        cout<<ans.size()<<endl;
        for(int i=0;i<(int)ans.size();i++)cout<<ans[i]<<" \n"[i==ans.size()-1];
    }
    if(k==3){
        //cerr<<"k=3"<<endl;
        vector<vector<int>>ng(n);
        auto dfs=[&](auto&&f,int u,int par=-1)->pair<int,int> {
            pair<int,int>tmp={u,u};
            //cerr<<u<<" "<<g[u].size()<<endl;
            for(auto v:g[u])if(v!=par){
                //cerr<<u<<" "<<v<<endl;
                auto [start,end]=f(f,v,u);
                //cerr<<u<<" "<<v<<" "<<start<<" "<<end<<endl;
                ng[tmp.second].emplace_back(end);
                ng[end].emplace_back(tmp.second);
                tmp.second=start;
            }
            return tmp;
        };
        dfs(dfs,0);
        cout<<accumulate(p.begin(),p.end(),0LL)<<endl;
        cout<<n<<endl;
        vector<int>ans={0};
        vector<int>vis(n,0);
        vis[0]=1;
        while(ans.size()!=n){
            int now=ans.back();
            for(auto u:ng[now])if(!vis[u]){
                ans.emplace_back(u);
                vis[u]=1;
                break;
            }
        }
        for(auto&e:ans)e++;
        for(int i=0;i<(int)ans.size();i++)cout<<ans[i]<<" \n"[i==ans.size()-1];
    }
}