#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define dd(x) cout<<#x<<" is "<<x<<endl;
typedef pair<int,int> pii;
const int N = 2e5+5;
int a[N], vis[N], ans[N];
int n;
void dfs(int x, vector<vector<int>>& adj, vector<vector<int>>& newadj){
for(auto i: adj[x]){
if(vis[i]) continue;
vis[i] = 1;
newadj[x].pb(i);
newadj[i].pb(x);
dfs(i, adj, newadj);
}
}
void findsum(int x, int &sum, vector<vector<int>>& adj){
sum += a[x];
for(auto i: adj[x]){
if(vis[i]) continue;
vis[i] = 1;
findsum(i, sum, adj);
}
}
void recurse(vector<vector<int>>& adj, int x){
int mxnode = -1, mx = 0;
for(int i=1; i<=n; i++){
if(adj[i].empty()) continue;
if(a[i] > mx) mx = a[i], mxnode = i;
}
if(mxnode == -1) return;
int sum = 0;
memset(vis,0,sizeof(vis));
vis[mxnode] = 1;
findsum(mxnode, sum, adj);
if(sum < x) return;
vector<vector<int>> adj1(n+1);
for(int i=1; i<=n; i++){
for(auto j: adj[i]){
if(a[i] == mx or a[j] == mx){
if(a[i] == mx) ans[i] = 1;
if(a[j] == mx) ans[j] = 1;
} else {
adj1[i].pb(j);
adj1[j].pb(i);
}
}
}
memset(vis,0,sizeof(vis));
for(int i=1; i<=n; i++){
if(vis[i]) continue;
vis[i] = 1;
vector<vector<int>> newadj(n+1);
dfs(i, adj1, newadj);
recurse(newadj, mx);
}
}
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int m; cin>>n>>m;
for(int i=1; i<=n; i++) cin>>a[i];
vector<vector<int>> adj(n+1);
for(int i=0; i<m; i++){
int u,v; cin>>u>>v;
adj[u].pb(v);
adj[v].pb(u);
}
recurse(adj, 0);
for(int i=1; i<=n; i++) cout<<ans[i];
return 0;
}
