#include <bits/stdc++.h>
using namespace std;
template <typename T>
void get_int(T &x) {
  char t = getchar();
  bool neg = false;
  x = 0;
  for (; (t > '9' || t < '0') && t != '-'; t = getchar())
    ;
  if (t == '-') neg = true, t = getchar();
  for (; t <= '9' && t >= '0'; t = getchar()) x = x * 10 + t - '0';
  if (neg) x = -x;
}
template <typename T>
void print_int(T x) {
  if (x < 0) putchar('-'), x = -x;
  short a[20] = {}, sz = 0;
  while (x > 0) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
const int inf = 0x3f3f3f3f;
const long long Linf = 1ll << 61;
const double pi = acos(-1.0);
template <typename T>
inline void updmax(T &x, const T y) {
  if (x < y) x = y;
}
template <typename T>
inline void updmin(T &x, const T y) {
  if (x > y) x = y;
}
bool ok;
vector<int> g[200111], ans;
int c[200111], al[200111], n;
void dfs(int x, int f) {
  al[x] = c[x];
  for (int i = 0; i < (int)g[x].size(); i++)
    if (g[x][i] != f) {
      dfs(g[x][i], x);
      al[x] |= al[g[x][i]];
    }
}
void dfs2(int x, int f) {
  c[x] ^= 1;
  ans.push_back(x);
  for (int i = 0; i < (int)g[x].size(); i++)
    if (g[x][i] != f && al[g[x][i]]) {
      dfs2(g[x][i], x);
      c[x] ^= 1;
      ans.push_back(x);
    }
  if (c[x]) {
    if (x == 1)
      ok = 1;
    else {
      c[f] ^= 1;
      c[x] ^= 1;
      ans.push_back(f);
      ans.push_back(x);
    }
  }
}
int main() {
  get_int(n);
  for (int i = 1; i <= n; i++) {
    get_int(c[i]);
    c[i] = (c[i] == -1);
  }
  for (int i = 1, u, v; i < n; i++) {
    get_int(u), get_int(v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  c[1] ^= 1;
  dfs(1, 0);
  dfs2(1, 0);
  if (ok && ans.size() == 1) {
    int t = g[1][0];
    printf("1 %d 1 %d 1 %d 1 %d\n", t, t, t, t);
    return 0;
  }
  for (int i = 0; i < (int)ans.size() - ok; i++) printf("%d ", ans[i]);
  return 0;
}
