// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#ifdef ULVI
#include "debug.hpp"
#else
#define db(...)
#define dbv(v)
#define line()
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define enld endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll sz=2e5+100;
const ll mod=1e9+7;
const ll inf=1e18;
template<class T>
using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<ll> g[sz],par(sz),nodes[sz],sums(sz),comp(sz);
ll findp(ll x){
if(par[x]==x) return x;
return par[x]=findp(par[x]);
}
bool unite(ll a,ll b){
a=findp(a);
b=findp(b);
if(a==b) return 0;
if(comp[a]<comp[b]) swap(a,b);
par[b]=a;
sums[a]+=sums[b];
comp[a]+=comp[b];
for(ll i:nodes[b]) nodes[a].push_back(i);
nodes[b].clear();
return 1;
}
void solve(){
ll n,m;
cin>>n>>m;
vector<pll> v(n);
for(ll i=0;i<n;i++){
cin>>v[i].ff;
v[i].ss=i+1;
}
sort(all(v));
for(ll i=0;i<m;i++){
ll o,p;
cin>>o>>p;
g[o].push_back(p);
g[p].push_back(o);
}
string ans(n+5,'1');
for(auto [val,idx]:v){
par[idx]=idx;
sums[idx]=val;
nodes[idx].push_back(idx);
comp[idx]=1;
for(ll i:g[idx]){
if(par[findp(i)]){
if(sums[findp(i)]<val) for(ll j:nodes[i]) ans[j]='0';
unite(i,idx);
}
}
}
for(ll i=1;i<=n;i++) cout<<ans[i];
}
int main(){
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t=1;
// cin>>t;
for(ll _=1;_<=t;_++){
// cout<<"Scenario #"<<_<<":\n";
solve();
}
}
