/**
 * @file qoj4209-3.cpp
 * @author n685
 * @brief
 * @date 2024-06-24
 *
 *
 */
#include <bits/stdc++.h>

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbgR(...) 4242
#define dbgP(...) 420
#define dbgRP(...) 420420
void nline() {}
#endif

struct DSU {
  std::vector<int> val;
  std::vector<int64_t> sz;
  std::vector<bool> g;
  int cnt;
  DSU() = default;
  DSU(int n, const std::vector<int64_t> &s)
      : val(n, -1), sz(s), g(n, true), cnt(n) {}
  auto find(int n) -> int {
    if (val[n] < 0) {
      return n;
    } else {
      int rt = find(val[n]);
      if (!g[val[n]]) {
        g[n] = false;
      }
      return val[n] = rt;
    }
  }
  auto markFalse(int n) -> int {
    g[n] = false;
    if (val[n] < 0) {
      return n;
    } else {
      return val[n] = markFalse(val[n]);
    }
  }
  auto good(int n) -> bool {
    find(n);
    return g[n];
  }
  auto unite(int u, int v) -> bool {
    u = find(u), v = find(v);
    if (u == v) {
      return false;
    }
    val[u] += val[v];
    sz[u] += sz[v];
    val[v] = u;
    cnt--;
    return true;
  }
  auto connected(int u, int v) -> bool { return find(u) == find(v); }
  auto size(int u) -> int64_t { return sz[find(u)]; }
  auto count() -> int { return cnt; }
};

auto main() -> int {
#ifndef LOCAL
  std::cin.tie(nullptr)->sync_with_stdio(false);
#endif

  int n, m;
  std::cin >> n >> m;

  std::vector<int64_t> s(n);
  for (auto &i : s) {
    std::cin >> i;
  }
  std::vector<std::vector<int>> adj(n);
  for (int i = 0; i < m; ++i) {
    int a, b;
    std::cin >> a >> b;
    --a;
    --b;
    if (std::pair{s[a], a} < std::pair{s[b], b}) {
      std::swap(a, b);
    }
    adj[a].push_back(b);
  }
  std::vector<int> ind(n);
  std::iota(ind.begin(), ind.end(), 0);
  std::ranges::stable_sort(ind, {}, [&](int i) { return s[i]; });
  DSU dsu(n, s);
  for (int i : ind) {
    for (int j : adj[i]) {
      if (dsu.connected(i, j)) {
        continue;
      }
      if (dsu.size(j) < s[i]) {
        dsu.markFalse(j);
      }
      dsu.unite(i, j);
    }
  }
  for (int i = 0; i < n; ++i) {
    std::cout << "01"[dsu.good(i)];
  }
  std::cout << '\n';
}