// Bolatulu
#include <bits/stdc++.h>
// #include <art.h>
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define eb emplace_back
#define ins insert
#define F first
#define S second
#define md (tl+tr)/2
#define TL v+v,tl,md
#define TR v+v+1,md+1,tr
#define Tl t[v].l,tl,md
#define Tr t[v].r,md+1,tr
#define all(x) (x).begin(),(x).end()
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define int long long
// #define file(s) freopen(s".in", "r", stdin); freopen(s".out", "w", stdout);
using namespace std;
int binpow(int a,int n,int M) {
if (n==0)
return 1;
if (n%2!=0)
return (a * binpow(a,n-1,M))%M;
int z=binpow(a,n/2,M);
return (z*z)%M;
}
const ll INF = 1e18+7;
const int N = 2e5+7;
int n,m,s[N],sz[N],p[N],ans[N],nxt[N],mx[N],pos[N],sum[N];
vector <int> g[N];
int find(int v) {
if (p[v]==v)
return v;
return p[v]=find(p[v]);
}
void unite(int u,int v) {
u=find(u), v=find(v);
if (u==v)
return;
if (sz[u]<sz[v])
swap(u,v);
p[v]=u;
sz[u]+=sz[v];
sum[u]+=sum[v];
}
void solve() {
cin >> n >> m;
vector <pair <int,int>> v;
int mxs=0;
for (int i=1;i<=n;i++) {
cin >> s[i];
mxs=max(mxs,s[i]);
v.eb(s[i],i);
p[i]=pos[i]=i;
mx[i]=sum[i]=s[i];
sz[i]=1;
}
sort(all(v));
while (m--) {
int u,v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
for (int i=0;i<n;i++) {
int x=v[i].S;
for (auto to : g[x]) {
if (s[to]<=s[x] and find(x)!=find(to)) {
to=find(to);
if (sum[to]>=s[x]) {
nxt[pos[to]]=x;
}
mx[to]=s[x];
pos[to]=x;
unite(x,to);
}
}
}
for (int i=n-1;i>=0;i--) {
int x=v[i].S;
if (mxs==s[x] or (nxt[x] and ans[nxt[x]]))
ans[x]=1;
else
ans[x]=0;
}
for (int i=1;i<=n;i++)
cout << ans[i];
}
signed main() {
// file("jenga");
ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int test = 1;
// cin >> test;
while (test--) {
solve();
if (test)
cout << '\n';
}
return 0;
}
