/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/
#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define int long long
#define isz(x) (int)x.size()
using namespace std;
void solve() {
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<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
if (k == 1) {
vector<int> dp(n), par(n);
pair<int, int> res = {0, -1};
auto dfs = [&](auto self, int u, int p) -> void {
par[u] = p;
dp[u] += a[u];
res = max(res, {dp[u], u});
for (auto v : g[u]) if (v != p) {
dp[v] = dp[u];
self(self, v, u);
}
};
dfs(dfs, 0, -1);
vector<int> trace;
int u = res.second;
cout << res.first << endl;
while (u != -1) {
trace.emplace_back(u);
u = par[u];
}
reverse(all(trace));
cout << isz(trace) << endl;
for (auto u : trace) cout << u + 1 << " \n"[u == trace.back()];
return;
}
if (k == 2) {
}
}
signed main() {
#ifndef CDuongg
if (fopen(taskname".inp", "r"))
assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
freopen("bai3.inp", "r", stdin);
freopen("bai3.out", "w", stdout);
auto start = chrono::high_resolution_clock::now();
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1; //cin >> t;
while(t--) solve();
#ifdef CDuongg
auto end = chrono::high_resolution_clock::now();
cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif
}
