#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream fin ("cerere.in");
ofstream fout("cerere.out");
int n,i,K[100003],x,y;
vector <int> L[100003],sort_top;
void build_sort_top(int nod,int t)
{
    for(auto j:L[nod])
        if(j!=t)
            build_sort_top(j,nod);
    sort_top.push_back(nod);
}
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>K[i];
    for(i=1;i<n;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);
    }
    for(i=1;i<=n;i++)
        build_sort_top(i,0);
    reverse(sort_top.begin(),sort_top.end());
    return 0;
}