#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
const int N = 2e5+5;
int n,m,a[N],par[N],sum[N],suc[N];
vector<tuple<int,int,int>>vc;
int find(int u){
if(u == par[u]) return u;
int uu = find(par[u]);
suc[u] |= suc[par[u]];
return par[u] = uu;
}
void join(int u, int v){
u = find(u);
v = find(v);
if(u == v) return;
if(sum[u] < a[v]) suc[u] = 1;
par[u] = v;
sum[v] += sum[u];
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> a[i];
sum[i] = a[i];
par[i] = i;
}
for(int i = 1; i <= m; i++){
int u,v;
cin >> u >> v;
if(a[u] < a[v]) swap(u,v);
vc.push_back({a[u],v,u});
}
sort(vc.begin(),vc.end());
for(auto[c,u,v]: vc) join(u,v);
for(int i = 1; i <= n; i++){
//find(i);
cout << 1-suc[i];
}
}
