//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
vector<int> dpdeep;
vector<int> p;
vector<vector<int>> g;
vector<int> road;
void print() {
    int res = 0;
    for (auto i : road)
        res += p[i];
    cout << res << '\n' << road.size() << '\n';
    for (auto i : road)
        cout << i + 1 << ' ';
}
void dfs1(int v, int pr) {
    dpdeep[v] = p[v];
    for (auto i : g[v]) {
        if (i != pr) {
            dfs1(i, v);
            dpdeep[v] = max(dpdeep[v], dpdeep[i] + p[v]);
        }
    }
}
void dfs2(int v, int pr) {
    road.push_back(v);
    int tr = -1;
    for (auto i : g[v]) {
        if (i != pr) {
            if (tr == -1)
                tr = i;
            if (dpdeep[tr] < dpdeep[i])
                tr = i;
        }
    }
    if (tr != -1)
        dfs2(tr, pr);
}
void sl1(int n) {
    dpdeep.assign(n, {});
    dfs1(0, 0);
    dfs2(0, 0);
    print();
}
vector<int> dfroad;
vector<int> ls;
void dfs3(int v, int pr) {
    dfroad.push_back(v);
    ls[v] = dfroad.size() - 1;
    for (auto i : g[v]) {
        if (i == pr)
            continue;
        dfs3(i, v);
        dfroad.push_back(v);
        ls[v] = dfroad.size() - 1;
    }
}
void sl3(int n) {
    ls.assign(n, {});
    vector<int> sn(n);
    dfs3(0, 0);
    int trns = 3;
    int pos = 0;
    for (auto i : dfroad) {
        trns--;
        if (trns == 0) {
            if (sn[i] == 1)
                exit(1);
            road.push_back(i);
            sn[i] = 1;
            trns = 3;
        }
        if (pos == ls[i] and sn[i] == 0) {
            road.push_back(i);
            sn[i] = 1;
            trns = 3;
        }
        pos++;
    }
    print();
}
void solve() {
    int n, k;
    cin >> n >> k;
    p.assign(n, {});
    g.assign(n, {});
    for (int i = 0; i < n - 1; ++i) {
        int a, b;
        cin >> a >> b;a--;b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for (int i = 0; i < n; ++i) {
        cin >> p[i];
    }
    if (k == 1)
        sl1(n);
    if (k == 3)
        sl3(n);
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    while (t--) {
        solve();
    }
}