#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const ll oo = 1e18;
const int N = 2005;

int n, sz[N], best_j[N][N][2];
ll k, a[N], dp[N][N][2], next_dp[N][2];
vector<int> adj[N], chosen;

void dfs(int u, int p) {
    sz[u] = 1;
    for (int i = 0; i <= n; i++) dp[u][i][0] = dp[u][i][1] = oo;
    dp[u][0][0] = 0;
    dp[u][1][1] = a[u];

    for (int v : adj[u]) {
        if (v == p) continue;
        dfs(v, u);

        int nsz = sz[u] + sz[v];
        for (int i = 0; i <= nsz; i++) {
            next_dp[i][0] = next_dp[i][1] = oo;
        }

        for (int i = 0; i <= sz[u]; i++) {
            for (int j = 0; j <= sz[v]; j++) {
                ll min_v = min(dp[v][j][0], dp[v][j][1]);
                if (dp[u][i][0] != oo && min_v != oo) {
                    ll val0 = dp[u][i][0] + min_v;
                    if (val0 < next_dp[i + j][0]) {
                        next_dp[i + j][0] = val0;
                        best_j[v][i + j][0] = j;
                    }
                }
                if (dp[u][i][1] != oo && dp[v][j][0] != oo) {
                    ll val1 = dp[u][i][1] + dp[v][j][0];
                    if (val1 < next_dp[i + j][1]) {
                        next_dp[i + j][1] = val1;
                        best_j[v][i + j][1] = j;
                    }
                }
            }
        }
        sz[u] = nsz;
        for (int i = 0; i <= sz[u]; i++) {
            dp[u][i][0] = next_dp[i][0];
            dp[u][i][1] = next_dp[i][1];
        }
    }
}

void trace(int u, int p, int c, int st) {
    for (int i = (int)adj[u].size() - 1; i >= 0; i--) {
        int v = adj[u][i];
        if (v == p) continue;

        int j = best_j[v][c][st];
        int v_st = 0;
        if (st == 0) {
            if (dp[v][j][0] <= dp[v][j][1]) v_st = 0;
            else v_st = 1;
        } else v_st = 0;
        trace(v, u, j, v_st);
        c -= j;
    }

    if (st == 1) chosen.push_back(u);
}

void solve() {
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 0; i < n - 1; i++) {
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    dfs(1, 0);

    int ans = 0, best = 0;
    for (int c = n; c >= 0; c--) {
        ll min_w = oo;
        int st = -1;
        if (dp[1][c][0] <= k) { min_w = dp[1][c][0]; st = 0; }
        if (dp[1][c][1] <= k && dp[1][c][1] < min_w) { min_w = dp[1][c][1]; st = 1; }
        
        if (st != -1) {
            ans = c;
            best = st;
            break;
        }
    }

    if (ans > 0) trace(1, 0, ans, best);

    cout << ans << "\n";
    sort(chosen.begin(), chosen.end());
    for (int i = 0; i < (int)chosen.size(); i++)
        cout << chosen[i] << " ";
    cout << "\n";
} 

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int tests = 1; // cin >> tests;
    while (tests--) solve();

    #ifndef ONLINE_JUDGE
    cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif

    return 0;
}