#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define lsb(x) (x&(-x))
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
cerr << #x << " : ";\
for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
cerr << "outputting " << #j<< ":\n";\
for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}
#define vi vector<int>
#define fr(i,x,y) for(int i=x;i<=y;i++)
/*
* leader being current root of the group
* currently handling : must be root also
* merge 2 things : draw line from leader(smaller) to larger
* add their values!
*/
#define defN 200001
vector<vi>chlz(defN);
vi can(defN,true);
vi grpsz(defN),pointers(defN);
vi ans(defN);
void dfs(int cn, bool cc)
{
if(!can[cn])cc=false;
ans[cn]=cc;
for(int to:chlz[cn])
{
dfs(to,cc);
}
}
int leader(int x)
{
if(pointers[x]==x)return x;
return (pointers[x]=leader(pointers[x]));
}
void merge(int x, int y)
{
grpsz[y]+=grpsz[x];
pointers[x]=y;
}
signed main()
{
int t1,t2,t3,t4;
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
//ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,m;cin>>n>>m;
vector<int>vals(n+1);
vector<pii>tbs;
fr(i,1,n)
{
cin>>vals[i];
tbs.pb(mp(vals[i],i));
}
sort(tbs.begin(),tbs.end());
fr(i,1,n){grpsz[i]=vals[i];}
fr(i,1,n){pointers[i]=i;}
vector<vi>ajlz(n+1);
fr(i,1,m)
{
cin>>t1>>t2;
ajlz[t1].pb(t2);
ajlz[t2].pb(t1);
}
vector<bool>vis(n+1,false);
for(pii curr:tbs)
{
int cn=curr.ss;
vis[cn]=true;
for(int fr:ajlz[cn])
{
fr=leader(fr);
if(fr==cn)continue;
//basis lying on the fact that rn u are the root
if(!vis[fr])continue;
if(grpsz[fr]<curr.ff){can[fr]=false;}
chlz[cn].pb(fr);
merge(fr,cn);
}
}
dfs(tbs.back().ss,1);
fr(i,1,n){cout<<ans[i];}
}
