#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

mt19937 rnd(234);
const ll inf = 1e18;

int n, k;
vector<ll> a;
vector<vector<int>> g;
vector<int> prnt;
vector<int> ans;

void dfs0(int v, int p) {
    prnt[v] = p;
    auto it = find(all(g[v]), p);
    if (it != g[v].end()) {
        g[v].erase(it);
    }
    for (auto to : g[v]) {
        dfs0(to, v);
    }
}

void dfs1(int v, ll sm, pair<ll, int> &rs) {
    sm += a[v];
    rs = max(rs, make_pair(sm, v));
    for (auto to : g[v]) {
        dfs1(to, sm, rs);
    }
}

void dfs2(int v, ll sm, pair<ll, int> &rs) {
    for (auto to : g[v]) {
        sm += a[to];
    }
    rs = max(rs, make_pair(sm, v));
    for (auto to : g[v]) {
        dfs1(to, sm, rs);
    }
}

ll solve() {
    ans.clear();
    if (k == 1) {
        pair<ll, int> rs = {-1, -1};
        dfs1(0, 0, rs);
        vector<int> way;
        int v = rs.second;
        while (v != -1) {
            way.push_back(v);
            v = prnt[v];
        }
        reverse(all(way));
        ans = way;
        return rs.first;
    }
    if (k == 2) {
        pair<ll, int> rs = {-1, -1};
        dfs2(0, a[0], rs);
        vector<int> way;
        int v = rs.second;
        while (v != -1) {
            way.push_back(v);
            v = prnt[v];
        }
        reverse(all(way));
        int ln = (int)way.size();
        for(int i = 0; i < ln; i += 1){
            int u = way[i];
            int v = -1;
            if(i + 1 < ln){
                v = way[i + 1];
            }
            ans.push_back(u);
            for(auto to: g[u]){
                if(to != v){
                    ans.push_back(to);
                    ans.push_back(u);
                }
            }
        }
        return rs.first;
    }
    return -1;
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n >> k;
    g.assign(n, vector<int>());
    for (int i = 0; i < n - 1; i += 1) {
        int u, v;
        cin >> u >> v;
        --u;
        --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    a.resize(n);
    for (int i = 0; i < n; i += 1) {
        cin >> a[i];
    }
    prnt.resize(n);
    dfs0(0, -1);
    ll rs = solve();
    cout << rs << "\n";
    cout << (int)ans.size() << "\n";
    for (auto t : ans) {
        cout << t + 1 << " ";
    }
    cout << "\n";
    return 0;
}