#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
int n,m;
vii a;
vi p,s;
vector<ll> b;
int parent(int x){
if(p[x]==x)return x;
return p[x]=parent(p[x]);
}
void merge(int x,int y){
x=parent(x);
y=parent(y);
if(x==y)return;
if(s[x]<s[y])swap(x,y);
s[x]+=s[y];
b[x]+=b[y];
p[y]=x;
}
int main() {
// ios::sync_with_stdio(0);
// cin.tie(0);
cin>>n>>m;
a.resize(n);
b.resize(n);
REP(i,0,n)cin>>b[i];
REP(i,0,m){
int x,y;cin>>x>>y;
x--;y--;
a[x].PB(y);
a[y].PB(x);
}
p.resize(n);s.resize(n,1);
REP(i,0,n)p[i]=i;
set<pair<ll,int>> c;
REP(i,0,n)c.insert({b[i],i});
string ans(n,'1');
REP(i,0,n){
int x=c.begin()->F,y=c.begin()->S;
c.erase(c.begin());
vi arr;
for(auto u:a[y])if(b[u]<=b[y]){
merge(u,y);
arr.PB(u);
}
for(auto u:arr){
if(c.count({b[u],u})){
c.erase(c.find({b[u],u}));
c.insert({b[x],u});
}
b[u]=b[x];
}
if(arr.size()==0)ans[y]='0';
if(s[parent(y)]==n)ans[y]='1';
}
REP(i,0,n)if(ans[parent(i)]=='0')ans[i]='0';
cout<<ans;
}
