#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define bit(n) (1LL << (n))
#define getbit(x, i) (((x) >> (i)) & 1)
#define pii pair<int, int>
#define ALL(x) x.begin(), x.end()
using namespace std;
const int M = 5e5 + 5;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int oo = 1e9;
const long long ooo = 1e18;
const double pi = acos(-1);

template<typename T1, typename T2> bool mini(T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi(T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

typedef long long ll;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("file.inp", "r",stdin);
    #endif
    int n; cin >> n;
    vector <vector <int>> adj(n);
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    vector <int> a(n);
    for (int &x : a)
        cin >> x;

    vector <int> minval(n);
    vector <int> h(n, 0), f(n, 0);
    
    function <void(int, int)> dfs = [&](int u, int p) {
        minval[u] = a[u] - h[u];
        for (int v : adj[u]) if (v != p) {
            h[v] = h[u] + 1;
            dfs(v, u);
            mini(minval[u], minval[v]);
        }
    };

    h[0] = 0;
    dfs(0, -1);

    function <void(int, int, int)> dfs2 = [&](int u, int p, int cur) {
        f[u] = min(cur - h[u], minval[u] + h[u]);

        pair <int, int> pir = {a[u] - h[u], oo};
        for (int v : adj[u]) if (v != p) {
            if (mini(pir.se, minval[v])) {
                if (pir.se < pir.fi)
                    swap(pir.fi, pir.se);
            }
        }

        for (int v : adj[u]) if (v != p) {
            int val = (minval[v] == pir.fi) ? pir.se : pir.fi;
            dfs2(v, u, min(cur, val + 2 * h[u]));
        }
    };

    dfs2(0, -1, oo);
    // for (int x : f)
    //     cerr << x << " ";
    int r = 0;

    while (f[r] != 0) 
        r++;
    
    h[r] = 0;
    dfs(r, -1);

    int mx = r;
    for (int i = 0; i < n; i++) if (f[i] == 0) {
        if (h[i] > h[mx]) 
            mx = i;
    }
    // cerr << r << " " << mx << " " << h[mx] << "\n";

    function <void(int, int, vector <int>&)> getnodes = [&](int u, int p, vector <int> &s) {
        if (f[u] == 0) {
            s.push_back(u);
            return;
        }
        
        for (int v : adj[u]) if (v != p) {
            getnodes(v, u, s);   
        }
    };

    vector<pair <int, int>> ord;
    if (h[mx] % 2 == 0) {
        if (mx == r) {
            cout << r + 1 << " ";
        } else {
            for (int rep = 0; rep < h[mx] / 2; rep++) {
                for (int i : adj[mx]) {
                    if (h[i] < h[mx]) {
                        mx = i;
                        break;
                    }
                }
            }

            vector <int> s;
            assert(a[mx] == *min_element(ALL(a)));
            h[mx] = 0;
            for (int i : adj[mx]) {
                s.clear();
                getnodes(i, mx, s);
                for (int x : s) {
                    ord.push_back({s.size(), x});
                }
            }
        }
    } else {
        int lef = 0, rig = 0;
        for (int i = 0; i < n; i++) if (f[i] == 0) {
            if (h[i] < h[mx])
                lef++;
            else
                rig++;
        }

        for (int i = 0; i < n; i++) if (f[i] == 0) {
            if (h[i] < h[mx])
                ord.push_back({lef, i});
            else
                ord.push_back({rig, i});
        }
    }

    sort(ALL(ord));
    for (auto [sz, i] : ord) {
        cout << i + 1 << " ";
    }

    for (int i = 0; i < n; i++) if (f[i] > 0) {
        cout << i + 1 << " ";
    }

    for (int i = 0; i < n; i++) if (f[i] < 0) {
        cout << i + 1 << " ";
    }

    return 0;
}