#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <set>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <map>
#include <chrono>
#include <random>
#include <bitset>
#include <tuple>
#define SZ(x) int(x.size())
#define FR(i,a,b) for(int i=(a);i<(b);++i)
#define FOR(i,n) FR(i,0,n)
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define A first
#define B second
#define mp(a,b) make_pair(a,b)
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef unsigned __int128 U128;
typedef __int128 I128;
typedef std::pair<int,int> PII;
typedef std::pair<LL,LL> PLL;
using namespace std;
//1st subtask: run for every village, store pq of next village with smallest size +id
//2nd subtask: ts a tree. all kids can be absorbed. i can win iff sz[i]>=s[par[i]] && par[i] can win
const LL MAXN=2e5+5;
vector<LL> adj[MAXN];
LL s[MAXN], sz[MAXN], ans[MAXN];
void dfss(LL u, LL p){
sz[u]=s[u];
for (LL v:adj[u]){
if (v==p) continue;
dfss(v,u);
sz[u]+=sz[v];
}
}
void dfs(LL u, LL p){
for (LL v:adj[u]){
if (v==p) continue;
if (sz[v]>=s[u] && ans[u]==1) ans[v]=1;
else ans[v]=0;
dfs(v,u);
}
}
signed main(){
FAST;
LL n,m; cin>>n>>m;
FR(i,1,n+1) cin>>s[i];
while(m--){
LL a,b; cin>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfss(1,-1);
ans[1]=1;
dfs(1,-1);
FR(i,1,n+1) cout<<ans[i];
return 0;
}
