#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 7;
int n, m, a[N], p[N];
bool ans[N];
vector<int> pos[N];
int get(int v) {
return (p[v] == v ? v : p[v] = get(p[v]));
}
long long s[N];
void comb(int u, int v) {
u = get(u);
v = get(v);
if(u == v) {
return;
}
p[u] = v;
s[v] += s[u];
}
long long val[N];
int b[N];
bool cmp2(int i, int j) {
return a[i] < a[j];
}
vector<int> g[N];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
int mx = 0;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
mx = max(mx, a[i]);
p[i] = i;
b[i] = i;
s[i] = a[i];
}
for(int i = 1; i <= n; ++i) {
ans[i] = 1;
}
vector<pair<int, int> > e;
for(int i = 1; i <= m; ++i) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
e.push_back({u, v});
}
sort(b+1, b+1+n, cmp2);
for(int i = 1; i <= n; ++i) {
if(a[b[i]] == mx) {
break;
}
int r = i;
while(r<n && a[b[r]] == a[b[r+1]]) {
r++;
}
for(int j = 1; j <= n; ++j) {
pos[j].clear();
}
for(int k = i; k <= r; ++k) {
for(auto u : g[b[k]]) {
if(a[u] <= a[b[k]]) {
comb(u, b[k]);
}
}
}
for(int j = 1; j <= n; ++j) {
pos[get(j)].push_back(j);
}
for(int j = 1; j <= n; ++j) {
long long cur = s[j];
if(cur < a[b[r+1]]) {
for(auto x : pos[j]) {
ans[x] = 0;
}
}
}
for(int k = i; k <= r; ++k) {
for(auto u : g[b[k]]) {
long long cur = s[get(b[k])];
if(cur >= a[u]) {
comb(u, b[k]);
}
}
}
i = r;
}
for(int i = 1; i <= n; ++i) {
cout << ans[i];
}
return 0;
}
