#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll mod = ll(1e9 + 7);
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int TT = 1;
  while (TT--) {
    ll n_food, n_ppl;
    cin >> n_food >> n_ppl;
    vector<ll> W(n_food);
    for (auto& x : W) cin >> x;
    vector<pair<ll, ll>> F(n_ppl);
    vector<unordered_set<int>> n_ppl_fav_food(n_food);
    for (int i = 0; i < n_ppl; ++i) {
      ll a, b;
      cin >> a >> b;
      --a;
      --b;
      F[i] = {a, b};
      n_ppl_fav_food[a].emplace(i);
      n_ppl_fav_food[b].emplace(i);
    }
    vector<bool> visited(n_food);
    vector<int> ans;
    queue<int> q;
    for (int f = 0; f < n_food; ++f) {
      if (n_ppl_fav_food[f].size() <= W[f]) {
        visited[f] = true;
        q.emplace(f);
      }
    }
    while (q.size()) {
      auto f = q.front();
      q.pop();
      for (auto u : n_ppl_fav_food[f]) {
        int other = F[u].first == f ? F[u].second : F[u].first;
        n_ppl_fav_food[other].erase(u);
        if (!visited[other] && n_ppl_fav_food[other].size() <= W[other]) {
          q.emplace(other);
        }
        ans.emplace_back(u);
      }
      n_ppl_fav_food[f].clear();
    }
    reverse(ans.begin(), ans.end());
    if (ans.size() == n_ppl) {
      cout << "ALIVE" << endl;
      for (int x : ans) {
        cout << (x + 1) << " ";
      }
      cout << endl;
    } else {
      cout << "DEAD" << endl;
    }
  }
}
