#include <bits/stdc++.h>
using namespace std;
const int N = int(2e5) + 9;
int a[N];
int p[N];
int done[N];
int win[N];
int64_t sum[N];
vector<int> g[N];
vector<int> sons[N];
int get(int x) {
return (x == p[x] ? x : p[x] = get(p[x]));
}
void dfs(int u) {
win[u] = 1;
for (int v : sons[u]) {
dfs(v);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
p[i] = i;
sum[i] = a[i];
}
while (m--) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
vector<int> order(n);
iota(order.begin(), order.end(), 1);
sort(order.begin(), order.end(), [&](int x, int y) {
return a[x] < a[y];
});
for (int u : order) {
done[u] = 1;
for (int v : g[u]) {
v = get(v);
if (!done[v] || v == u) continue;
if (sum[v] >= a[u]) {
sons[u].push_back(v);
}
sum[u] += sum[v];
p[v] = u;
}
}
dfs(order[n - 1]);
for (int i = 1; i <= n; i++) {
cout << win[i];
}
return 0;
}
