// duonglaptrinh
# include <bits/stdc++.h>
# define pa pair<int, int>
# define fi first
# define se second
using namespace std;
const int N = 2e5+5;
int n, m;
long long a[N];
int b[N];
vector<int> way[N];
vector<pa> root[N];
int par[N], sz[N];
long long val[N];
void build_par() {
for(int i = 1; i <= n; i++) {
par[i] = i, sz[i] = 1, val[i] = a[i];
}
}
int find_par(int u) {
if(par[u] == u) {
return par[u];
}
return par[u] = find_par(par[u]);
}
bool kethop(int u, int v, bool yes) {
u = find_par(u), v = find_par(v);
if(u == v) {
return 0;
}
if(sz[u] < sz[v]) {
swap(u, v);
}
if(yes) {
par[v] = u;
sz[u] += sz[v];
val[u] += val[v];
}
return 1;
}
bool yes[N], ok[N];
void dfs(int u, int goc, int dc) {
ok[u] = dc;
for(pa x : root[u]) {
int v = x.fi, w = x.se;
if(v == goc) {
continue;
}
dfs(v, u, dc & w);
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if(fopen("nhap.inp", "r")) {
freopen("nhap.inp", "r", stdin);
freopen("nhap.out", "w", stdout);
}
cin>>n>>m;
for(int i = 1; i <= n; i++) {
cin>>a[i];
b[i] = i;
}
build_par();
sort(b + 1, b + 1 + n, [](int x, int y) {return a[x] < a[y];});
for(int i = 1; i <= m; i++) {
int u, v;
cin>>u>>v;
way[u].push_back(v);
way[v].push_back(u);
}
for(int i = 1; i <= n; i++) {
sort(way[i].begin(), way[i].end(), [](int x, int y) {return a[x] > a[y];});
}
for(int i = 1; i <= n; i++) {
int u = b[i];
yes[u] = 1;
for(int v : way[u]) {
if(!yes[v]) {
continue;
}
v = find_par(v);
if(!kethop(u, v, 0)) {
continue;
}
if(val[v] < a[u]) {
root[u].push_back({v, 0});
root[v].push_back({u, 0});
}
else {
root[u].push_back({v, 1});
root[v].push_back({u, 1});
}
int par_u = find_par(u);
par[v] = par_u, val[par_u] += val[v];
kethop(u, v, 1);
}
}
dfs(b[n], 0, 1);
for(int i = 1; i <= n; i++) {
cout<<ok[i];
}
return 0;
}
