#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
ll N;
vector<vector<ll>> g;
vector<ll> a;
vector<ll> ans;
vector<ll> see;

ll dfs(ll u,ll v) {
	see[v] = 1;
	ll ret = a[v];
	for (ll w : g[v]) {
		if (ans[w] != -1 || u==w) { continue; }

		ret = min(ret, dfs(v, w));
	}

	return ret;
}

void update(ll u, ll v, ll X) {
	if (a[v] == X) { ans[v] = 0; }
	for (ll w : g[v]) {
		if (ans[w]!=-1||u == w) { continue; }
		update(v, w, X);
	}
}


int main() {
	cin >> N;
	a.resize(N + 1);
	g.resize(N + 1);
	repn(i, N)cin >> a[i];

	repn(i, N - 1) {
		ll x, y;
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}

	ans.assign(N + 1, -1);
	while (1) {
		see.assign(N + 1, 0);
		repn(v, N) {
			if (see[v] == 1) { continue; }
			if (ans[v] != -1) { continue; }
			ll X = dfs(0, v);
			//cout << X << endl;
			update(0, v, X);
		}

		repn(v, N) {
			for (ll w : g[v]) {
				if (ans[v] == -1 && ans[w] == 0) { ans[v] = 1; }
			}
		}

		bool b = 1;
		repn(v, N) { if (ans[v] == -1) { b = 0; } }
		if (b) { break; }
	}

	repn(v, N) {
		if (ans[v] == 1) { cout << v << " "; }
	}
	cout << endl;
}

Measured memory_bytes: 4032