#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

pair<int, vector<int>> solve1(int N, auto ch, auto fa, auto profit) {
    int max_sum = 0, last = 0;
    
    function<void(int, int)> dfs = [&](int now, int sum) {
        sum += profit[now];
        if (chmax(max_sum, sum)) last = now;
        for (int x : ch[now]) dfs(x, sum);
    };
    dfs(1, 0);
    
    vector<int> trades;
    while (last != 0) trades.eb(last), last = fa[last];
    reverse(ALL(trades));
    
    return {max_sum, trades};
}

pair<int, vector<int>> solve2(int N, auto ch, auto fa, auto profit) {
    // TODO
}

pair<int, vector<int>> solve3(int N, auto ch, auto fa, auto profit) {
    int ans = accumulate(ALL(profit), int(0));
    vector<int> trades;
    
    function<void(int, int)> dfs = [&](int now, int dep) {
        if (~dep & 1) trades.eb(now);
        for (int x : ch[now]) dfs(x, dep+1);
        if (dep & 1) trades.eb(now);
    };
    dfs(1, 0);
    
    return {ans, trades};
}

void solve() {
    int N, K; cin >> N >> K;
    
    vector<vector<int>> adj(N+1);
    for (int i = 0; i < N-1; ++i) {
        int u, v; cin >> u >> v;
        adj[u].eb(v), adj[v].eb(u);
    }
    
    vector<int> p(N+1);
    for (int i = 1; i <= N; ++i) cin >> p[i];
    
    vector<vector<int>> ch(N+1);
    vector<int> fa(N+1, 0);
    
    function<void(int)> dfs = [&](int now) {
        for (int x : adj[now]) {
            if (x != fa[now]) ch[now].eb(x), fa[x] = now, dfs(x);
        }
    };
    dfs(1);
    
    int ans = 0;
    vector<int> trades;
    if (K == 1) tie(ans, trades) = solve1(N, ch, fa, p);
    if (K == 2) tie(ans, trades) = solve2(N, ch, fa, p);
    if (K == 3) tie(ans, trades) = solve3(N, ch, fa, p);
    
    cout << ans << "\n";
    cout << SZ(trades) << "\n";
    for (int i = 0; i < SZ(trades); ++i) cout << trades[i] << " \n"[i == SZ(trades)-1];
}

int32_t main() {
    fastIO();
    
    int t = 1; // cin >> t;
    for (int _ = 1; _ <= t; ++_) {
        solve();
    }
    
    return 0;
}

#else

#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
#define int i64
using f80 = long double;
#define double f80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "\u001b[33m"), \
    fprintf(stderr, "At [%s], line %d: (%s) = ", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), \
    fprintf(stderr, "\u001b[0m")
template <typename T> void _do(T &&_t) { cerr << _t << "\n"; }
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) { cerr << _t << ", ", _do(_u...); }
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

template <typename T, typename U> bool chmin(T &lhs, U rhs) { return lhs > rhs ? lhs = rhs, 1 : 0; }
template <typename T, typename U> bool chmax(T &lhs, U rhs) { return lhs < rhs ? lhs = rhs, 1 : 0; }

#endif