#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=4e5+5;
int n,m;
int siz[N],fa[N],fail[N];
struct nd{int u,v,w;} e[N];
bool cmp(nd x,nd y){return x.w<y.w;}
int getfa(int x){
	if(x==fa[x]) return x;
	int fath = getfa(fa[x]);
	fail[x] |= fail[fa[x]];
	return fa[x] = fath;
}
signed main(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%lld",&siz[i]);
		fa[i] = i;
	}
	for(int i=1;i<=m;i++){
		scanf("%lld%lld",&e[i].u,&e[i].v);
		if(siz[e[i].u]<siz[e[i].v])
			swap(e[i].u,e[i].v);
		e[i].w = siz[e[i].u];
	}
	sort(e+1,e+m+1,cmp);
	for(int i=1;i<=m;i++){
		int x=e[i].u,y=e[i].v;
		int fx=getfa(x),fy=getfa(y);
		if(siz[fy]<siz[fx]) fail[fy]=1;
		siz[fx] += siz[fy];
		fa[fy] = fx;
	}
	for(int i=1;i<=n;i++){
		getfa(i);
		printf("%d",!fail[i]);
	}
	return 0;
}