#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define pb push_back
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
ll maxx1;
vector<vl> conexiones;
vl val, route, croute;
void dfs1(ll cur, ll par, ll c){
ll now = c+val[cur];
croute.pb(cur);
if(now > maxx1){
route = croute;
maxx1 = now;
}
for(auto &x : conexiones[cur]){
if(x != par){
dfs1(x, cur, now);
}
}
croute.pop_back();
}
int main(){
ll n, k;
cin >> n >> k;
conexiones = vector<vl>(n);
val = vl(n);
ff(i, 0, n-1){
ll a, b;
cin >> a >> b;
a--;
b--;
conexiones[a].pb(b);
conexiones[b].pb(a);
}
ff(i, 0, n){
cin >> val[i];
}
if(k == 1){
maxx1 = 0;
croute = {};
dfs1(0, -1, 0);
cout << maxx1 << ed << route.size() << ed;
for(auto &a : route) cout << a+1 << " ";
return 0;
}
}
