#include <bits/stdc++.h>
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c *x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  ~debug() { cerr << endl; }
  template <class c>
  typename enable_if<sizeof dud<c>(0) != 1, debug &>::type operator<<(c i) {
    cerr << boolalpha << i;
    return *this;
  }
  template <class c>
  typename enable_if<sizeof dud<c>(0) == 1, debug &>::type operator<<(c i) {
    return *this << range(begin(i), end(i));
  }
  template <class c, class b>
  debug &operator<<(pair<b, c> d) {
    return *this << "(" << d.first << ", " << d.second << ")";
  }
  template <class c>
  debug &operator<<(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it;
    return *this << "]";
  }
};
long double eps = (long double)1 / 1e6;
const long double pi = 3.14159265359;
long long inf = 2e18, mod1 = 1e9 + 7, mod2 = -1;
long long sqr(long long a) { return a * a; }
long long qb(long long a) { return a * a * a; }
long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); }
long long binpow(long long a, long long b, long long mod) {
  return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
                    : sqr(binpow(a, b / 2, mod)) % mod)
           : 1;
}
long long binmult(long long a, long long b, long long mod) {
  return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
                    : (2 * binmult(a, b / 2, mod)) % mod)
           : 0;
}
const long long R = 1e4;
const long long tx[4] = {0, 0, -1, 1};
const long long ty[4] = {-1, 1, 0, 0};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const int N = 2e5 + 1;
int n, m;
bool used[N];
long long w[N];
pair<int, int> a[N];
set<int> lol[N];
void bad() {
  cout << "DEAD";
  exit(0);
}
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  ;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> w[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> a[i].first >> a[i].second;
    --a[i].first;
    --a[i].second;
    lol[a[i].first].insert(i);
    lol[a[i].second].insert(i);
  }
  queue<int> q;
  for (int i = 0; i < n; i++) {
    if (w[i] >= (long long)lol[i].size()) {
      q.push(i);
      used[i] = 1;
    }
  }
  vector<int> ans;
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (auto &z : lol[v]) {
      ans.push_back(z);
    }
    for (auto &z : lol[v]) {
      int who = (a[z].first ^ a[z].second) ^ v;
      lol[who].erase(z);
      if ((long long)lol[who].size() <= w[who] && !used[who]) {
        used[who] = 1;
        q.push(who);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (!used[i]) bad();
  }
  cout << "ALIVE\n";
  reverse(ans.begin(), ans.end());
  for (auto &z : ans) {
    cout << z + 1 << " ";
  }
  return 0;
}
