#pragma GCC diagnostic error "-std=c++11"
#pragma GCC target("avx")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<iostream>
#include<vector>
#include<algorithm>
#include<random>
#include<ctime>
#include<queue>
using namespace std;
const int maxn=200005;
int n,m,p[maxn],ans[maxn],vis[maxn],ag[maxn],st[maxn],cnt;
vector<int> tree[maxn];
pair<int,int> g[maxn];
queue<int> q;
int dfs(int s,int x){
	/*if(p[s]>=x)return x;
	int res=p[s];
	ag[s]=1;
	st[++cnt]=s;
	for(int j=0;j<tree[s].size();++j){
		int s_=tree[s][j];
		if(vis[s_]||ag[s_])continue;
		res+=dfs(s_,x-res);
		if(res>=x)return x;
	}
	return res;*/
	int res=p[s];
	while(q.size())q.pop();
	q.push(s);
	st[++cnt]=s;ag[s]=1;
	while(q.size()){
		int t=q.front();q.pop();
		for(int j=0;j<tree[t].size();++j){
			int t_=tree[t][j];
			if(ag[t_]||vis[t_])continue;
			st[++cnt]=t_;ag[t_]=1;
			q.push(t_);
			res+=p[t_];
			if(res>=x)break;
		}
		if(res>=x)break;
	}
	return res;
}
void color(int s){
	ans[s]=0;
	for(int j=0;j<tree[s].size();++j){
		int s_=tree[s][j];
		if(vis[s_]||!ans[s_])continue;
		color(s_);
	}
}
mt19937 rnd(time(0)^(*new char));
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;++i)cin>>p[i],g[i]=make_pair(p[i],i),ans[i]=1;
	sort(g+1,g+n+1);
	for(int i=1;i<=m;++i){
		int u,v;cin>>u>>v;
		tree[u].push_back(v);
		tree[v].push_back(u);
	}
	for(int i=1;i<=n;++i)shuffle(tree[i].begin(),tree[i].end(),rnd);
	for(int i=n;i>=1;--i)if(ans[g[i].second]){
		int s=g[i].second;
		vis[s]=1;
		for(int j=0;j<tree[s].size();++j){
			int s_=tree[s][j];
			if(vis[s_])continue;
			if(dfs(s_,p[s])<p[s])color(s_);
			for(int k=1;k<=cnt;++k)ag[st[k]]=0;
			cnt=0;
		}
	}
	for(int i=1;i<=n;++i)cout<<ans[i];
	return 0;
}