#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);
    }
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll N, K;
    cin >> N >> K;
    vector<vector<ll>> g(N);
    for(ll i = 1; i < N; i++) {
        ll A, B;
        cin >> A >> B;
        A--; B--;
        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);
    for(ll& p : P) cin >> p;
    auto ans = solve1(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;
}