#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n - 1; i++) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        g[x].emplace_back(y);
        g[y].emplace_back(x);
    }
    vector<int> d(n);
    for (int i = 0; i < n; i++) {
        cin >> d[i];
    }
    int mnd = *min_element(d.begin(), d.end());
    vector<int> r;
    for (int i = 0; i < n; i++) {
        if (d[i] == mnd) {
            r.emplace_back(i);
        }
    }
    vector<int> f(n);
    if (r.size() == 2) {
        vector<int> b(n), c(n);
        function<void(int, int)> Dfs = [&](int v, int p) {
            if (d[v] == mnd * 2 - 1) {
                c[b[v]]++;
            }
            for (int to: g[v]) {
                if (to == p) {
                    continue;
                }
                b[to] = b[v];
                Dfs(to, v);
            }
        };
        b[r[0]] = r[0];
        b[r[1]] = r[1];
        Dfs(r[0], r[1]);
        Dfs(r[1], r[0]);
        for (int i = 0; i < n; i++) {
            if (d[i] < mnd * 2 - 1) {
                f[i] = n + 10;
            } else if (d[i] == mnd * 2 - 1) {
                f[i] = c[b[i]];
            } else {
                f[i] = n + 20;
            }
        }
    } else if (r.size() == 1) {
        vector<int> b(n), c(n);
        function<void(int, int)> Dfs = [&](int v, int p) {
            if (d[v] == mnd * 2 - 1) {
                c[b[v]]++;
            }
            for (int to: g[v]) {
                if (to == p) {
                    continue;
                }
                b[to] = b[v];
                Dfs(to, v);
            }
        };
        for (int t: g[r[0]]) {
            b[t] = t;
            Dfs(t, r[0]);
        }
        for (int i = 0; i < n; i++) {
            if (d[i] < mnd * 2) {
                f[i] = n + 10;
            } else if (d[i] == mnd * 2) {
                f[i] = c[b[i]];
            } else {
                f[i] = n + 20;
            }
        }
    } else {
        assert(false);
    }
    vector<int> ans(n);
    iota(ans.begin(), ans.end(), 0);
    sort(ans.begin(), ans.end(), [&](int i, int j) {
        return make_pair(f[i], i) < make_pair(f[j], j);
    });
    for (int i = 0; i < n; i++) {
        cout << ans[i] + 1 << " \n"[i == n - 1];
    }
    return 0;
}