Problem: I see a pink boar and I want it painted black. Black boars look much more awesome and mighty than the pink ones. Since Jaggy became the ruler of the forest, he has been trying his best to improve the diplomatic relations between the forest region and the nearby ones. 

Some other rulers, however, have requested too much in return for peace between their two regions, so he realized he has to resort to intimidation. Once a delegate for diplomatic relations of a neighboring region visits Jaggy’s forest, if they see a whole bunch of black boars, they might suddenly change their mind about attacking Jaggy. Black boars are really scary, after all. 

Jaggy’s forest can be represented as a tree (connected graph without cycles) with n vertices. Each vertex represents a boar and is colored either black or pink. Jaggy has sent a squirrel to travel through the forest and paint all the boars black. The squirrel, however, is quite unusually trained and while it traverses the graph, it changes the color of every vertex it visits, regardless of its initial color: pink vertices become black and black vertices become pink. 

Since Jaggy is too busy to plan the squirrel’s route, he needs your help. He wants you to construct a walk through the tree starting from vertex 1 such that in the end all vertices are black. A walk is a sequence of vertices, such that every consecutive pair has an edge between them in a tree.

Input

The first line of input contains integer n (2 ≤ n ≤ 200 000), denoting the number of vertices in the tree. The following n lines contains n integers, which represent the color of the nodes.

If the i-th integer is 1, if the i-th vertex is black and  - 1 if the i-th vertex is pink.

Each of the next n - 1 lines contains two integers, which represent the indexes of the vertices which are connected by the edge. Vertices are numbered starting with 1.

Output

Output path of a squirrel: output a sequence of visited nodes' indexes in order of visiting. In case of all the nodes are initially black, you should print 1. Solution is guaranteed to exist. If there are multiple solutions to the problem you can output any of them provided length of sequence is not longer than 107.

Example

Input

5
1
1
-1
1
-1
2 5
4 3
2 4
4 1


Output

1 4 2 5 2 4 3 4 1 4 1

Note

At the beginning squirrel is at node 1 and its color is black. Next steps are as follows: 

  * From node 1 we walk to node 4 and change its color to pink. 
  * From node 4 we walk to node 2 and change its color to pink. 
  * From node 2 we walk to node 5 and change its color to black. 
  * From node 5 we return to node 2 and change its color to black. 
  * From node 2 we walk to node 4 and change its color to black. 
  * We visit node 3 and change its color to black. 
  * We visit node 4 and change its color to pink. 
  * We visit node 1 and change its color to pink. 
  * We visit node 4 and change its color to black. 
  * We visit node 1 and change its color to black. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
const int maxn = 200005;
vector<int> g[maxn];
int fat[maxn];
vector<int> son[maxn];
int now[maxn];
bool has[maxn];
int i, j, k, n;
struct hi {
  int num;
  void push(int t) {
    num++;
    if (num > 1) printf(" ");
    printf("%d", t);
  }
} q;
void DFS(int x, int y) {
  fat[x] = y;
  if (now[x] < 0) has[x] = true;
  for (unsigned int i = 0; i < g[x].size(); i++) {
    int v = g[x][i];
    if (fat[v] != 0) continue;
    son[x].push_back(v);
    DFS(v, x);
    if (now[v] < 0 || has[v]) has[x] = true;
  }
}
void find(int x) {
  q.push(x);
  if (x > 1) now[x] = -now[x];
  if (son[x].size() == 0) {
    has[x] = false;
    return;
  }
  for (unsigned int i = 0; i < son[x].size(); i++) {
    int v = son[x][i];
    if (has[v]) {
      find(v);
      now[x] = -now[x];
      q.push(x);
    }
  }
  for (unsigned int i = 0; i < son[x].size(); i++) {
    int v = son[x][i];
    if (has[v]) {
      find(v);
      now[x] = -now[x];
      q.push(x);
    }
  }
  if (now[x] < 0)
    has[x] = true;
  else
    has[x] = false;
  if (x == 1 && has[x]) {
    q.push(son[1][0]);
    q.push(x);
    q.push(son[1][0]);
  }
}
int main() {
  scanf("%d", &n);
  memset(has, 0, sizeof(has));
  for (i = 1; i <= n; i++) scanf("%d", &now[i]);
  for (i = 1; i <= n - 1; i++) {
    scanf("%d%d", &j, &k);
    g[j].push_back(k);
    g[k].push_back(j);
  }
  DFS(1, -1);
  q.num = 0;
  find(1);
  n = 0;
  return 0;
}