#include<bits/stdc++.h>
using namespace std;

const int NR = 2e5;

int n, m;
int id[NR + 5], rk[NR + 5], f1[NR + 5], f2[NR + 5], mx[NR + 5];
long long a[NR + 5], sum[NR + 5];
vector<int> e[NR + 5];

int find1(int u) {
    return f1[u] == u ? u : f1[u] = find1(f1[u]);
}

int find2(int u) {
    return f2[u] == u ? u : f2[u] = find2(f2[u]);
}

bool cmp(int x, int y) {
    return a[x] < a[y];
}

int main() {
    // freopen("b.in", "r", stdin);
    // freopen("b.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        sum[i] = a[i];
        id[i] = i;
        f1[i] = i;
        f2[i] = i;
    }
    for(int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        e[u].emplace_back(v);
        e[v].emplace_back(u);
    }
    sort(id + 1, id + n + 1, cmp);
    for(int i = 1; i <= n; i++) {
        rk[id[i]] = i;
    }
    for(int i = 1; i <= n; i++) {
        int u = id[i];
        for(int v : e[u]) {
            if(rk[u] < rk[v]) {
                continue;
            }
            int rv = find1(v);
            if(f1[rv] != u) {
                f1[rv] = u;
                if(sum[rv] >= a[u]) {
                    f2[rv] = u;
                }
                sum[u] += sum[rv];
                mx[u] = max(mx[u], rk[v]);
            }
        }
    }
    for(int i = 1; i <= n; i++) {
        cout << (find2(i) == id[n]);
    }

    return 0;
}