Problem Statement

There is a tree with $N$ vertices, numbered $1$ through $N$. The $i$-th of the $N-1$ edges connects vertices $a_i$ and $b_i$.

Currently, there are $A_i$ stones placed on vertex $i$. Takahashi and Aoki will play a game using this tree.

First, Takahashi will select a vertex and place a piece on it. Then, starting from Takahashi, they will alternately perform the following operation:

• Remove one stone from the vertex currently occupied by the piece.
• Then, move the piece to a vertex that is adjacent to the currently occupied vertex.

The player who is left with no stone on the vertex occupied by the piece and thus cannot perform the operation, loses the game. Find all the vertices $v$ such that Takahashi can place the piece on $v$ at the beginning and win the game.

Constraints

• $2 ≦ N ≦ 3000$
• $1 ≦ a_i,b_i ≦ N$
• $0 ≦ A_i ≦ 10^9$
• The given graph is a tree.

Input

The input is given from Standard Input in the following format:

N
A_1 A_2 … A_N
a_1 b_1
:
a_{N-1} b_{N-1}

Output

Print the indices of the vertices $v$ such that Takahashi can place the piece on $v$ at the beginning and win the game, in a line, in ascending order.