#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
typedef unsigned long long ull;
using namespace std;
const int N=2e5+5;
int n,m,a[N],dis[N],par[N],dp[N];
vector<int> adj[N],v;
bool cmp(int x,int y){
return dis[x]<dis[y];
}
void dfs(int node,int d,int p){
dis[node]=d;
dp[node]=a[node];
par[node]=p;
for (auto u:adj[node]){
if (u==p) continue;
dfs(u,d+1,node);
dp[node]+=dp[u];
}return;
}
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n>>m;
for (int i=1;i<=n;i++) cin>>a[i];
for (int i=1;i<=m;i++){
int x,y;
cin>>x>>y;
adj[x].pb(y);
adj[y].pb(x);
}dfs(1,0,0);
for (int i=2;i<=n;i++) v.pb(i);
sort(v.begin(),v.end(),cmp);
//for (int i=1;i<=n;i++) cout<<dp[i]<<endl;
for (auto node:v){
if (dp[node]<a[par[node]]) continue;
dp[node]=dp[par[node]];
}
for (int i=1;i<=n;i++) cout<<bool(dp[i]==dp[1]);
return 0;
}
