#include <bits/stdc++.h>
#define int long long
using namespace std;
vector <int> p;
vector <vector <int> > gr;
vector <int> sm, s;
vector <bool> ise;
int get(int x) {
if (x != p[x]) p[x] = get(p[x]);
return p[x];
}
void unite(int u, int v) {
int u1 = get(u), v1 = get(v);
if (u1 == v1) return ;
if (s[u1] > s[v1]) swap(u1, v1);
gr[v1].push_back(u1);
p[u1] = v1;
}
void dfs(int i) {
sm[i] += s[i];
for (auto j : gr[i]) {
if (p[i] == j) continue;
p[j] = i;
dfs(j);
sm[i] += sm[j];
}
return ;
}
void dfs1(int i) {
ise[i] = true;
for (auto j : gr[i]) {
if (j == p[i]) continue;
if (sm[j] >= s[i]) dfs1(j);
}
return ;
}
void solve() {
int n, m;
cin >> n >> m;
s.assign(n + 1, 0);
for (int i = 1; i <= n; i ++) cin >> s[i];
vector <tuple <int, int, int> > ed;
for (int i = 1, u, v, w; i <= m; i ++) {
cin >> u >> v;
w = max(s[u], s[v]);
ed.push_back({w, u, v});
}
sort(ed.begin(), ed.end());
p.assign(n + 1, 0);
iota(p.begin(), p.end(), 0);
gr.assign(n + 1, vector <int> ());
for (auto [w, u, v] : ed) unite(u, v);
int r = get(1);
sm.assign(n + 1, 0);
p.assign(n + 1, 0);
p[r] = r;
dfs(r);
ise.assign(n + 1, false);
dfs1(r);
for (int i = 1; i <= n; i ++) cout << ise[i];
cout << '\n';
return ;
}
signed main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t --) solve();
return 0;
}
