#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= 1000000007;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
int gcd(int a, int b) {
  while (b) {
    int t = a % b;
    a = b;
    b = t;
  }
  return a;
}
int fst[901000], nxt[4000011], vv[4000011], e, sum[901000], vis[901000];
int tot, col[901000];
void init() {
  e = 0;
  memset(fst, -1, sizeof fst);
}
void add(int u, int v) {
  vv[e] = v, nxt[e] = fst[u], fst[u] = e++;
  vv[e] = u, nxt[e] = fst[v], fst[v] = e++;
}
void dfs1(int u, int f) {
  sum[u] = 0;
  for (int i = fst[u]; ~i; i = nxt[i]) {
    int v = vv[i];
    if (v == f) continue;
    dfs1(v, u);
    sum[u] += sum[v] + (vis[v] == -1);
  }
}
vector<int> ans;
void chang(int u) {
  if (vis[u] == 1)
    vis[u] = -1, tot++;
  else if (vis[u] == -1)
    vis[u] = 1, tot--;
}
void dfs2(int u, int f) {
  ans.push_back(u);
  if (tot == 0) return;
  if (u != 1) chang(u);
  int x = 0;
  for (int i = fst[u]; ~i; i = nxt[i]) {
    int v = vv[i];
    x = v;
    if (v == f || (vis[v] != -1 && !sum[v])) continue;
    dfs2(v, u);
    ans.push_back(u);
    chang(u);
    if (tot == 0) return;
  }
  if (vis[u] == 1)
    return;
  else {
    if (u != 1) {
      ans.push_back(f);
      chang(f);
      ans.push_back(u);
      chang(u);
      if (tot == 0) return;
    } else {
      ans.push_back(x);
      ans.push_back(u);
      ans.push_back(x);
      chang(u);
      if (tot == 0) return;
    }
  }
}
int main() {
  int n;
  cin >> n;
  init();
  for (int i = 1; i <= n; i++) {
    scanf("%d", &vis[i]), col[i] = vis[i];
    if (vis[i] == -1) tot++;
  }
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    add(u, v);
  }
  dfs1(1, 0);
  dfs2(1, 0);
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
}
