#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = int;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define FOR_(n) for (ll _ = 0; (_) < (ll)(n); ++(_))
#define FOR(i, n) for (ll i = 0; (i) < (ll)(n); ++(i))
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
//const ll mod = 1000000009;
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
#define FOR_R(i, n) for (ll i = (ll)(n)-1; (i) >= 0; --(i))
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a,const T b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a,const T b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};
 
void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
vector<ll> g[200000];
vector<ll> ans;
ll use[200000];
ll p[200000];
ll dp[200000][2][3];
deque<ll> way[200000][2][3];
int dfs(int a,int b,int x){
  for(auto e:g[a]){
    if(e==b) continue;
    if(x==0){
      use[a]=1;
      ans.pb(a);
      x=3;
    }
    x=dfs(e,a,x-1);
    x--;
  }
  if(use[a]==0){
    use[a]=1;
    ans.pb(a);
    x=3;
  }
  return x;
}
bool dfs3(int a,int b,int idx){
  if(a==idx){
    ans.pb(a);
    return true;
  }
  for(auto e:g[a]){
    if(e==b) continue;
    if(dfs3(e,a,idx)){
      ans.pb(a);
      return true;
    }
  }
  return false;
}
void dfs2(int a,int b){
  for(auto e:g[a]){
    if(e==b) continue;
    p[e]+=p[a];
    dfs2(e,a);
  }
}
void Merge(deque<ll> &a,deque<ll> b){
  for(auto e:b) a.pb(e);
}
void solve(int i,int b){
  vector<int> v;
  for(auto e:g[i]){
    if(e==b) continue;
    solve(e,i);
    v.pb(e);
  }
  dp[i][0][1]=p[i];
  way[i][0][1]={i};
  dp[i][0][0]=p[i];
  ll idx=0,m=-inf;
  for(auto e:v) if(chmax(m,dp[e][0][0]-dp[e][0][1])) idx=e;
  dp[i][1][1]=p[i];
  for(auto e:v){
    if(e==idx) dp[i][1][1]+=dp[e][0][0];
    else dp[i][1][1]+=dp[e][0][1];
  }
  dp[i][0][0]=dp[i][1][1];
  for(auto e:v){
    if(e!=idx) Merge(way[i][1][1],way[e][0][1]);
  }
  for(auto e:v){
    if(e==idx) Merge(way[i][1][1],way[e][0][0]);
  }
  Merge(way[i][1][1],{i});
  Merge(way[i][0][0],{i});
  for(auto e:v){
    if(e==idx) Merge(way[i][0][0],way[e][1][1]);
  }
  for(auto e:v){
    if(e!=idx) Merge(way[i][0][0],way[e][0][1]);
  }
  ll sum=0;
  for(auto e:v) sum+=dp[e][0][1];
  dp[i][1][2]=p[i];
  way[i][1][2]={i};
  vector<P> A,B,C;
  if(v.size()){
  multiset<P> X,Y,Z;
  for(int j=0;j<v.size();j++){
    X.insert({dp[v[j]][0][0]-dp[v[j]][0][1],v[j]});
    Y.insert({dp[v[j]][1][1]-dp[v[j]][0][1],v[j]});
    Z.insert({dp[v[j]][0][2]-dp[v[j]][0][1],v[j]});
  }
  auto itr=X.end();
  itr--;
  for(int i=0;i<3;i++){
    A.pb((*itr));
    if(itr==X.begin()) break;
    itr--;
  }
  auto itr2=Y.end();
  itr2--;
  for(int i=0;i<3;i++){
    B.pb((*itr2));
    if(itr2==Y.begin()) break;
    itr2--;
  }
  auto itr3=Z.end();
  itr3--;
  for(int i=0;i<3;i++){
    C.pb((*itr3));
    if(itr3==Z.begin()) break;
    itr3--;
  }
  sor(A);
  sor(B);
  sor(C);
  rever(A);
  rever(B);
  rever(C);
  }
  for(int ii2=0;ii2<int(v.size())&&ii2<3;ii2++){
    for(int j2=0;j2<int(v.size())&&j2<3;j2++){
      for(int k2=0;k2<int(v.size())&&k2<3;k2++){
        int ii=A[ii2].se,j=B[j2].se,k=C[k2].se;
        if(ii==j||j==k||k==ii) continue;
        ll sum2=sum;
        sum2-=dp[ii][0][1]+dp[j][0][1]+dp[k][0][1];
        sum2+=dp[ii][0][0]+dp[j][1][1]+dp[k][0][2];
        sum2+=p[i];
        chmax(dp[i][1][2],sum2);
      }
    }
  }
  for(int ii=0;ii<int(v.size());ii++){
    for(int k=0;k<int(v.size());k++){
      if(k==ii) continue;
      ll sum2=sum;
      sum2-=dp[v[ii]][0][1]+dp[v[k]][0][1];
      sum2+=dp[v[ii]][0][0]+dp[v[k]][1][2];
      sum2+=p[i];
      chmax(dp[i][1][2],sum2);
    }
  }
  for(int k=0;k<int(v.size());k++){
    ll sum2=sum;
    sum2-=dp[v[k]][0][1];
    sum2+=dp[v[k]][1][2];
    sum2+=p[i];
    chmax(dp[i][1][2],sum2);
  }
  for(int ii2=0;ii2<int(v.size())&&ii2<3;ii2++){
    for(int j2=0;j2<int(v.size())&&j2<3;j2++){
      for(int k2=0;k2<int(v.size())&&k2<3;k2++){
        int ii=A[ii2].se,j=B[j2].se,k=C[k2].se;
        if(ii==j||j==k||k==ii) continue;
        ll sum2=sum;
        sum2-=dp[ii][0][1]+dp[j][0][1]+dp[k][0][1];
        sum2+=dp[ii][0][0]+dp[j][1][1]+dp[k][0][2];
        sum2+=p[i];
        if(dp[i][1][2]==sum2&&way[i][1][2].size()==1){
          way[i][1][2]={};
          for(int l=0;l<v.size();l++){
            if(v[l]!=ii&&v[l]!=j&&v[l]!=k) Merge(way[i][1][2],way[v[l]][0][1]);
          }
          Merge(way[i][1][2],way[ii][0][0]);
          Merge(way[i][1][2],{i});
          Merge(way[i][1][2],way[j][1][1]);
          Merge(way[i][1][2],way[k][0][2]);
        }
      }
    }
  }
  for(int ii=0;ii<int(v.size());ii++){
    for(int k=0;k<int(v.size());k++){
      if(k==ii) continue;
      ll sum2=sum;
      sum2-=dp[v[ii]][0][1]+dp[v[k]][0][1];
      sum2+=dp[v[ii]][0][0]+dp[v[k]][1][2];
      sum2+=p[i];
      if(dp[i][1][2]==sum2&&way[i][1][2].size()==1){
        if(i==3){
        //  cout<<"IIK"<<" "<<v[ii]<<" "<<v[k]<<endl;
        }
        way[i][1][2]={};
        for(int l=0;l<v.size();l++){
          if(l!=ii&&l!=k) Merge(way[i][1][2],way[v[l]][0][1]);
        }
        Merge(way[i][1][2],way[v[ii]][0][0]);
        Merge(way[i][1][2],{i});
        Merge(way[i][1][2],way[v[k]][1][2]);
      }
    }
  }
  for(int k=0;k<int(v.size());k++){
    ll sum2=sum;
    sum2-=dp[v[k]][0][1];
    sum2+=dp[v[k]][1][2];
    sum2+=p[i];
    if(dp[i][1][2]==sum2&&way[i][1][2].size()==1){
      way[i][1][2]={};
      for(int l=0;l<int(v.size());l++){
        if(l!=k) Merge(way[i][1][2],way[v[l]][0][1]);
      }
      Merge(way[i][1][2],{i});
      Merge(way[i][1][2],way[v[k]][1][2]);
    }
  }
  way[i][0][2]={i};
  dp[i][0][2]=p[i];
  for(int j=0;j<int(v.size());j++){
    for(int k=0;k<int(v.size());k++){
      if(j==k) continue;
      ll sum2=sum;
      sum2-=dp[v[j]][0][1]+dp[v[k]][0][1];
      sum2+=dp[v[j]][1][1]+dp[v[k]][0][2];
      sum2+=p[i];
      chmax(dp[i][0][2],sum2);
    }
  }
  for(int j=0;j<int(v.size());j++){
    for(int k=0;k<int(v.size());k++){
      if(j==k) continue;
      ll sum2=sum;
      sum2-=dp[v[j]][0][1]+dp[v[k]][0][1];
      sum2+=dp[v[j]][1][1]+dp[v[k]][0][2];
      sum2+=p[i];
      if(dp[i][0][2]==sum2&&way[i][0][2].size()==1){
        way[i][0][2]={i};
        Merge(way[i][0][2],way[v[j]][1][1]);
        for(int l=0;l<v.size();l++){
          if(l!=j&&l!=k) Merge(way[i][0][2],way[v[l]][0][1]);
        }
        Merge(way[i][0][2],way[v[k]][0][2]);
      }
    }
  }
  for(int j=0;j<v.size();j++){
    if(chmax(dp[i][0][2],dp[v[j]][1][2]+p[i])){
      way[i][0][2]={i};
      Merge(way[i][0][2],way[v[j]][1][2]);
    }
  }
 /* cout<<i<<endl;
  for(auto e:way[i][1][2]) cout<<e<<" ";
  cout<<endl;
  for(auto e:way[i][0][2]) cout<<e<<" ";
  cout<<endl;
  for(auto e:way[i][0][0]) cout<<e<<" ";
  cout<<endl;
  for(auto e:way[i][1][1]) cout<<e<<" ";
  cout<<endl; */
}
int main() {
  cincout();
  ll n,k;
  cin>>n>>k;
  if(k==3){
    for(int i=0;i<n-1;i++){
      ll a,b;
      cin>>a>>b;
      a--;
      b--;
      g[a].pb(b);
      g[b].pb(a);
    }
    ll sum=0;
    for(int i=0;i<n;i++){
      ll x;
      cin>>x;
      sum+=x;
    }
    dfs(0,-1,0);
    cout<<sum<<endl;
    cout<<n<<endl;
    for(int i=0;i<n;i++) cout<<ans[i]+1<<" ";
    cout<<endl;
    return 0;
  }
  if(k==1){
    for(int i=0;i<n-1;i++){
      ll a,b;
      cin>>a>>b;
      a--;
      b--;
      g[a].pb(b);
      g[b].pb(a);
    }
    for(int i=0;i<n;i++){
      cin>>p[i];
    }
    dfs2(0,-1);
    ll m=-inf,idx=0;
    for(int i=0;i<n;i++) if(chmax(m,p[i])) idx=i;
    cout<<p[idx]<<endl;
    dfs3(0,-1,idx);
    cout<<ans.size()<<endl;
    rever(ans);
    for(auto e:ans) cout<<e+1<<" ";
    cout<<endl;
    return 0;
  }
  if(k==2){
    for(int i=0;i<n-1;i++){
      ll a,b;
      cin>>a>>b;
      a--;
      b--;
      g[a].pb(b);
      g[b].pb(a);
    }
    for(int i=0;i<n;i++){
      cin>>p[i];
    }
    solve(0,-1);
    cout<<dp[0][0][2]<<endl;
    cout<<way[0][0][2].size()<<endl;
    for(auto e:way[0][0][2]) cout<<e+1<<" ";
    cout<<endl;
  }
}