#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long find(long long p, vector<long long> &dsu) {
if(p==dsu[p]) return p;
long long u = find(dsu[p],dsu);
dsu[p]=u;
return u;
}
void un(long long a,long long b,vector<long long> &dsu,vector<long long> &ev) {
a=find(a,dsu);
b=find(b,dsu);
dsu[b]=a;
ev[a]+=ev[b];
}
int main()
{
long long n,m;
cin>>n>>m;
vector<long long> v(n),ev(n),dsu(n);
vector<pair<long long,long long>> s;
for (long long i = 0; i < n; ++i) {
long long x; cin>>x;
ev[i]=x;
v[i]=x;
s.push_back({x,i});
dsu[i]=i;
}
sort(s.begin(), s.end());
vector<pair<pair<long long,long long>,pair<long long,long long>>> ed;
for (long long i = 0; i < m; ++i) {
long long x,y; cin>>x>>y; x--; y--;
if(v[x]>v[y]) swap(x,y);
ed.push_back({{v[x],v[y]},{x,y}});
}
sort(ed.begin(),ed.end());
for (auto [u,t]:ed) {
auto [a,b] = t;
if(ev[find(a,dsu)]>=v[b]) un(a,b,dsu,ev);
}
long long ma = find(s[n-1].second,dsu);
for (long long i = 0; i < n; ++i) {
if(ma==find(i,dsu))cout<<"1";
else cout<<"0";
}
}
