#include<bits/stdc++.h>
using namespace std;
// #pragma GCC optimize (03)
#define int long long
#define ll long long
#define ld long double
#define tii tuple<int,int,int>
#define tii4 tuple<int,int,int,int>
#define pii pair<int,int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define mp make_pair
const int maxn=2e5+5, M=1e6, INF=0x3f3f3f3f, MOD=998244353;
int v[maxn], poder[maxn], pai[maxn], mark[maxn], ans[maxn];
pii aux[maxn];
set<pii> adj[maxn];
int find(int x){
if(mark[x]) return pai[x];
mark[x]=true;
if(pai[x]==-1) return -1;
return pai[x]=find(pai[x]);
}
int solve(){
int n,m; cin >> n >> m;
for(int i=1; i<=n; i++){
cin >> v[i];
aux[i]={v[i],i};
poder[i]=v[i];
}
for(int i=1; i<=m; i++){
int a,b; cin >> a >> b;
adj[a].insert({v[b],b});
adj[b].insert({v[a],a});
}
sort(aux+1, aux+1+n);
for(int i=1; i<n; i++){
auto[val_cur, cur] = aux[i];
mark[cur]=true;
pii wow = *adj[cur].begin();
while(mark[wow.ss]){
adj[cur].erase(adj[cur].begin());
wow = *adj[cur].begin();
}
auto[val_viz,viz] = *adj[cur].begin();
if(v[viz]<=poder[cur]) pai[cur]=viz;
else pai[cur]=-1;
// cout << cur << " " << viz << " " << pai[cur] << endl;
poder[viz]+=poder[cur];
if(adj[viz].size()<adj[cur].size()) swap(adj[cur],adj[viz]);
for(pii x : adj[cur]) adj[viz].insert(x);
}
memset(mark,0,sizeof mark);
int last = aux[n].ss;
ans[last]=1;
pai[last]=last, mark[last]=true;
// for(int i=1; i<=n; i++) cout << pai[i] << " ";
// cout << endl;
for(int i=1; i<=n; i++)if(!mark[i]) find(i);
for(int i=1; i<=n; i++){
if(pai[i]==-1) cout << 0;
else cout << ans[pai[i]];
}
cout << '\n';
return 0;
}
int32_t main(){
ios::sync_with_stdio(false); cin.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int t=1;
// cin >> t;
while(t--){
if(solve()) break;
}
}
