#include <bits/stdc++.h>
using namespace std;
const int MXN = 200005;
long long A[MXN], component_sum[MXN];
vector<int> adj[MXN], Tree[MXN];
int dsu_parent[MXN];
bool active[MXN], dead[MXN], mark[MXN], is_child[MXN];
int findpar(int i) {
if (dsu_parent[i] == i) return i;
return dsu_parent[i] = findpar(dsu_parent[i]);
}
void dfs(int u, bool deadpath) {
if (dead[u]) deadpath = true;
mark[u] = !deadpath;
for (int v : Tree[u]) {
dfs(v, deadpath);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<pair<int, int>> v_list(n);
for (int i = 1; i <= n; i++) {
cin >> A[i];
v_list[i - 1] = {A[i], i};
dsu_parent[i] = i;
component_sum[i] = A[i];
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
sort(v_list.begin(), v_list.end());
for (auto &p : v_list) {
int u = p.second;
active[u] = true;
for (int v : adj[u]) {
if (active[v]) {
int root_v = findpar(v);
if (root_v != u) {
if (component_sum[root_v] < A[u])
dead[root_v] = true;
dsu_parent[root_v] = u;
component_sum[u] += component_sum[root_v];
Tree[u].push_back(root_v);
is_child[root_v] = true;
}
}
}
}
for (int i = 1; i <= n; i++)
if (!is_child[i])
dfs(i, false);
for (int i = 1; i <= n; i++) cout << mark[i];
cout << endl;
return 0;
}
