#include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool chmax(ll& a, ll b) { if(a >= b) return 0; a = b; return 1; }
#define all(a) begin(a), end(a)

/*
    K = 1 => longest path
    K = 2 => DP
     aru chouten wo funde ue ni modoru toki:
      1 tu no child he susunde, modottekuru:
       gyakusaisei sureba child ni tuitemo onajikoto
      hoka no child ha itiban ue wo sawarudake de susumenai
     aru chouten wo funde ue ni modoranai toki:
      1 tu no child he susunde, modottekuru
      1 tu no child he susunde, modottekonai
      hoka no child ha itiban ue wo sawarudake de susumenai
      
*/
vector<ll> solve1(ll N, vector<vector<ll>> child, vector<ll> P) {
    struct T{
        ll val = 0, argmax = -1;
    };
    vector<T> dp(N);
    auto dfs = [&](ll i, auto dfs) -> void {
        for(ll j : child[i]) {
            dfs(j, dfs);
            if(chmax(dp[i].val, dp[j].val)) dp[i].argmax = j;
        }
        dp[i].val += P[i];
    };
    dfs(0, dfs);
    vector<ll> ans = {0};
    while(1) {
        const ll i = ans.back();
        if(child[i].empty()) return ans;
        ans.push_back(dp[i].argmax);
    }
}
vector<ll> solve2(ll N, vector<vector<ll>> child, vector<ll> P) {
    struct T{
        ll v0 = 0, v1 = 0, v2 = 0, i11 = -1, i21 = -1, i22 = -1;
    };
    vector<T> dp(N);
    auto dfs = [&](ll i, auto dfs) -> void {
        auto& [v0, v1, v2, i11, i21, i22] = dp[i];
        v0 = P[i];
        v1 = P[i];
        v2 = P[i];
        if(child[i].empty()) return;
        vector<pair<ll, ll>> add1, add2;
        for(ll j : child[i]) {
            dfs(j, dfs);
            const T ch = dp[j];
            v1 += ch.v0;
            v2 += ch.v0;
            add1.emplace_back(ch.v1 - ch.v0, j);
            add2.emplace_back(ch.v2 - ch.v0, j);
        }
        if(child[i].size() == 1) {
            auto [a1, i1] = add1[0];
            v1 += a1;
            i11 = i1;
            auto [a2, i2] = add2[0];
            v2 += a2;
            i22 = i2;
            return;
        }
        sort(all(add1), greater<>{});
        sort(all(add2), greater<>{});
        add1.resize(2);
        add2.resize(2);
        {
            ll diff = -1;
            for(auto [a1, i1] : add1) for(auto [a2, i2] : add2) if(i1 != i2 && chmax(diff, a1 + a2)) {
                i21 = i1;
                i22 = i2;
            }
            v2 += diff;
        }
        auto [a1, i1] = add1[0];
        v1 += a1;
        i11 = i1;
    };
    dfs(0, dfs);
    {
        auto dfs = [&](ll i, ll t, auto dfs) -> vector<ll> {
            auto [v0, v1, v2, i11, i21, i22] = dp[i];
            if(child[i].empty()) return {i};
            if(t == 0) return {i};
            if(t == 1) {
                vector<ll> ans = dfs(i11, 1, dfs);
                reverse(all(ans));
                ans.insert(ans.begin(), i);
                for(ll j : child[i]) if(j != i11) ans.push_back(j);
                return ans;
            }
            vector<ll> ans = i21 != -1 ? dfs(i21, 1, dfs) : vector<ll>{};
            reverse(all(ans));
            ans.insert(ans.begin(), i);
            for(ll j : child[i]) if(j != i21 && j != i22) ans.push_back(j);
            auto ans2 = dfs(i22, 2, dfs);
            ans.insert(ans.end(), all(ans2));
            return ans;
        };
        return dfs(0, 2, dfs);
    }
}
mt19937 rnd;
int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll N, K;
    cin >> N >> K;
    #ifdef DEBUG
    while(1){
    #endif
    vector<vector<ll>> g(N);
    for(ll i = 1; i < N; i++) {
        ll A, B;
    #ifdef DEBUG
        A = i; B = rnd() % i;
    #else
        cin >> A >> B;
        A--; B--;
    #endif
        g[A].push_back(B);
        g[B].push_back(A);
    }
    // erase parent
    auto dfs = [&](ll i, auto dfs) -> void {
        for(ll j : g[i]) {
            g[j].erase(find(all(g[j]), i));
            dfs(j, dfs);
        }
    };
    dfs(0, dfs);
    vector<ll> P(N);
    #ifdef DEBUG
    for(ll& p : P) p = rnd();
    #else
    for(ll& p : P) cin >> p;
    #endif
    auto ans = K == 1 ? solve1(N, g, P) : solve2(N, g, P);
    ll value = 0;
    for(ll& i : ans) value += P[i];
    cout << value << endl;
    cout << ans.size() << endl;
    for(ll i : ans) cout << i + 1 << ' ';
    cout << endl;
    #ifdef DEBUG
    }
    #endif
}