3 2
1 0 1
1 2
2 3
 10 10
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1
6 7
8 3
6 4
4 2
9 2
5 10
9 8
10 7
5 1
6 2

2
1
2
 0

#include <bits/stdc++.h>
using namespace std;
int n, m, u[300100], v[300100];
vector<pair<int, int> > g[300100];
int d[300100], b[300100];
bool vis[300100];
vector<int> ans;
void dfs(int t) {
  vis[t] = 1;
  for (auto e : g[t]) {
    int v = e.first, id = e.second;
    if (vis[v]) continue;
    dfs(v);
    if (d[v] != -1 && b[v] != d[v]) b[t] ^= 1, b[v] ^= 1, ans.push_back(id);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", d + i);
  }
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d", u + i, v + i);
    g[u[i]].push_back(make_pair(v[i], i));
    g[v[i]].push_back(make_pair(u[i], i));
  }
  bool flag = 1;
  for (int i = 1; i <= n; ++i)
    if (!vis[i] && d[i] == -1) dfs(i);
  for (int i = 1; i <= n; ++i)
    if (!vis[i]) {
      dfs(i);
      if (d[i] != -1 && b[1] != d[1]) flag = 0;
    }
  if (flag) {
    printf("%d\n", (int)ans.size());
    for (int v : ans) printf("%d\n", v);
  } else
    printf("-1\n");
  return 0;
}
