#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using ddatas = pair<long double, long double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pvec>;
const ll mod = 1000000007;
const ll inf = 1LL << 60;
const long double PI = acos(-1);
const long double eps = 1e-9;
template <class T>
inline bool chmax(T& a, T b) {
  bool x = a < b;
  if (x) a = b;
  return x;
}
template <class T>
inline bool chmin(T& a, T b) {
  bool x = a > b;
  if (x) a = b;
  return x;
}
void startupcpp() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}
long double distance(ddatas x, ddatas y) {
  long double a = x.first - y.first, b = x.second - y.second;
  return sqrt(a * a + b * b);
}
ll modinv(ll a) {
  ll b = mod, u = 1, v = 0, t;
  while (b) {
    t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  return (u + mod) % mod;
}
ll moddevide(ll a, ll b) { return (a * modinv(b)) % mod; }
vec modncrlistp, modncrlistm;
ll modncr(ll n, ll r) {
  if (n < r) return 0;
  ll i, size = modncrlistp.size();
  if (size <= n) {
    modncrlistp.resize(n + 1);
    modncrlistm.resize(n + 1);
    if (!size) {
      modncrlistp[0] = modncrlistm[0] = 1;
      size++;
    }
    for (i = size; i < (ll)n + 1; ++i) {
      modncrlistp[i] = modncrlistp[i - 1] * i % mod;
      modncrlistm[i] = modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n] * modncrlistm[r] % mod * modncrlistm[n - r] % mod;
}
ll modpow(ll a, ll n) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
ll gcd(ll a, ll b) {
  if (!b) return abs(a);
  return (a % b == 0) ? abs(b) : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll countdigits(ll n) {
  ll ans = 0;
  while (n) {
    n /= 10;
    ans++;
  }
  return ans;
}
ll sumdigits(ll n) {
  ll ans = 0;
  while (n) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
void topcoder(vector<int>& v) {
  string s;
  while (1) {
    cin >> s;
    int i = s[0] == '{', x = 0;
    while (s[i] >= '0' && s[i] <= '9') {
      x = x * 10 + s[i] - '0';
      ++i;
    }
    v.emplace_back(x);
    if (s[i] == '}') break;
  }
}
void topcoder(string& s) {
  string t;
  cin >> t;
  int i = 1;
  while (t[i] != '"') {
    s += t[i++];
  }
}
template <typename T>
struct segtree {
 private:
  int N = 1;
  T E;
  using func = function<T(T, T)>;
  func f, g;
  vector<T> tree;

 public:
  segtree(vector<T>& v, T e, func Merge, func Act) : E(e), f(Merge), g(Act) {
    int i, K = v.size();
    while (N < K) N <<= 1;
    tree.resize(N << 1);
    for (i = N; i < (ll)N + K; ++i) tree[i] = v[i - N];
    for (i = N + K; i < (ll)N << 1; ++i) tree[i] = E;
    for (i = N, --i; i >= (ll)1; --i)
      tree[i] = f(tree[i << 1], tree[(i << 1) | 1]);
  }
  segtree(vector<T>& v, T e, func Merge) {
    *this = segtree(v, e, Merge, Merge);
  };
  segtree(int N, T e, func F) {
    vector<T> res(N, e);
    *this = segtree(res, e, F);
  }
  void action(int i, T a) {
    if ((i < 0) | (i >= N)) return;
    i += N;
    tree[i] = g(tree[i], a);
    while (i > 1) {
      i >>= 1;
      tree[i] = f(tree[i << 1], tree[(i << 1) | 1]);
    }
  }
  void input(int i, T a) {
    if ((i < 0) | (i >= N)) return;
    tree[i += N] = a;
    while (i > 1) {
      i >>= 1;
      tree[i] = f(tree[i << 1], tree[(i << 1) | 1]);
    }
  }
  T queli(int a, int b) {
    if ((a >= b) | (a < 0) | (b <= 0) | (a >= N) | (b > N)) return E;
    T l(E), r(E);
    for (a += N, b += N; a < b; a >>= 1, b >>= 1) {
      if (a & 1) l = f(l, tree[a++]);
      if (b & 1) r = f(tree[--b], r);
    }
    return f(l, r);
  }
};
ll N, M, K, H, W, A, B, C, D;
string s, t;
int main() {
  int i = 0, j;
  cin >> N >> M;
  vector<pair<int, int>> a(N), fav(M);
  vector<vector<int>> g(N);
  for (i = 0; i < (ll)N; ++i) {
    cin >> a[i].first;
    a[i].second = i;
  }
  for (i = 0; i < (ll)M; ++i) {
    cin >> j;
    --a[--j].first;
    fav[i].first = j;
    g[j].emplace_back(i);
    cin >> j;
    --a[--j].first;
    fav[i].second = j;
    g[j].emplace_back(i);
  }
  vector<int> ans;
  set<int> se;
  segtree<pair<int, int>> tree(
      a, pair<int, int>(-mod, 0),
      [](pair<int, int> a, pair<int, int> b) { return max(a, b); });
  while (se.size() < M) {
    auto x = tree.queli(0, N);
    if (x.first < 0) {
      cout << "DEAD"
           << "\n";
      return 0;
    }
    for (auto next : g[x.second]) {
      if (se.insert(next).second) {
        ans.emplace_back(next + 1);
        j = fav[next].first ^ fav[next].second ^ x.second;
        ++a[j].first;
        tree.input(j, a[j]);
      }
    }
    a[x.second].first = -mod;
    tree.input(x.second, a[x.second]);
  }
  cout << "ALIVE"
       << "\n";
  reverse((ans).begin(), (ans).end());
  do {
    bool f = 0;
    for (auto outi : ans) {
      cout << (f ? " " : "") << outi;
      f = 1;
    }
    cout << "\n";
  } while (0);
}
