#include <bits/stdc++.h>
using namespace std;
int main() {
    int n, m; cin >> n >> m;
    int w[n] = {};
    for (int i = 0; i < n; i++)
        cin >> w[i];
    vector<pair<int, int>> e[n];
    int s[n] = {};
    for (int i = 0; i < m; i++) {
        int u, v; cin >> u >> v;
        --u, --v;
        e[u].emplace_back(v, i);
        e[v].emplace_back(u, i);
        ++s[u], ++s[v];
    }
    queue<int> que;
    for (int i = 0; i < n; i++)
        if (w[i] >= s[i])
            que.push(i);
    vector<int> ans;
    bool vis[m] = {};
    while (!que.empty()) {
        int u = que.front();
        que.pop(); 
        for (auto [v, i] : e[u]) {
            if (vis[i])
                continue;
            vis[i] = 1;
            ans.push_back(i);
            if (--s[v] == w[v])
                que.push(v);
        }
    }
    if (int(ans.size()) < m) {
        cout << "DEAD" << "\n";
        return 0;
    }
    cout << "ALIVE" << "\n";
    reverse(ans.begin(), ans.end());
    for (int i = 0; i < m; i++)
        cout << ans[i] + 1 << " \n"[i == m - 1];
}