#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second

struct dsu {
    int n;
    vector<int> par, siz, sum, cnt, mx, can;
    vector<vector<int>> sub;
    dsu() = default;
    dsu(int n_, vector<int> a) {
        n = n_;
        par.assign(n, 0);
        iota(all(par), 0);
        sum = a;
        siz.assign(n, 1);
        cnt.assign(n, 1);
        can.assign(n, 1);
        sub.assign(n, {});
        for (int i = 0; i < n; i++) {
            sub[i].pb(i);
        }
        mx = a;
    }

    int get(int v) {
        return (par[v] == v ? v : par[v] = get(par[v]));
    }

    void merge(int u, int v) {
        u = get(u);
        v = get(v);
        if (u == v) return;
        if (mx[u] < mx[v]) swap(u, v);
        int newcnt = cnt[u];
        if (sum[v] >= mx[u]) {
            newcnt += cnt[v];
        } else {
            for (auto &U : sub[v]) {
                can[U] = 0;
            }
            sub[v].clear();
        }

        if (siz[u] < siz[v]) swap(u, v);
        par[v] = u;
        mx[u] = max(mx[u], mx[v]);
        cnt[u] = newcnt;
        siz[u] += siz[v];
        sum[u] += sum[v];
        for (auto &U : sub[v]) sub[u].pb(U);
        sub[v].clear();
    }
};

void solve() {
    int n, m; cin >> n >> m;
    vector<int> c(n);
    for (int i = 0; i < n; i++) cin >> c[i];
    vector<int> ord(n);
    iota(all(ord), 0);
    sort(all(ord), [&](int i, int j){return c[i] < c[j];});
    vector<vector<int>> edges(n);
    for (int i = 0; i < m; i++) {
        int u, v; cin >> u >> v;
        u--; v--;
        if (c[u] < c[v]) swap(u, v);
        edges[u].pb(v);
    }
    dsu d(n, c);
    for (int i = 0; i < sz(ord); i++) {
        int nxt = i;
        while (nxt < n && c[ord[i]] == c[ord[nxt]]) nxt++;
        for (int j = i; j < nxt; j++) {
            for (int v : edges[ord[j]]) {
                d.merge(v, ord[j]);
            }
        }
        i = nxt - 1;
    }
    for (auto &u : d.can) cout << u;
    cout << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false); 
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}