#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
const int MAX = 2e5 + 5;
int n, m;
int arr[MAX];
vector<int> g[MAX];
bool visited[MAX];
bool bfs(int start){
fill(visited, visited + n + 1, 0);
ll cnt = 0;
set<pii> q;
q.insert({arr[start], start});
while(!q.empty()){
int node = q.begin()->second;
int c = q.begin()->first;
q.erase(q.begin());
visited[node] = true;
if(cnt >= c || node == start){
cnt += c;
for(int to:g[node]){
if(visited[to]) continue;
q.insert({arr[to], to});
}
}
else{
return false;
}
}
return true;
}
ll subTree[MAX];
bool possible[MAX];
void dfs1(int node, int p){
ll ans = arr[node];
for(int to:g[node]){
if(to == p) continue;
dfs1(to, node);
ans += subTree[to];
}
subTree[node] = ans;
}
void dfs2(int node, int p){
if(node == 1){
possible[node] = 1;
}
else{
possible[node] = (subTree[node] >= arr[p]);
}
if(!possible[node]) return;
for(int to:g[node]){
if(to == p) continue;
dfs2(to, node);
}
}
int main(){
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
cin >> arr[i];
}
for (int i = 0; i < m; i++)
{
int a, b; cin >> a >> b;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
if(n > 2000 || m > 2000){
dfs1(1, 1);
dfs2(1, 1);
for (int i = 1; i <= n; i++)
{
cout << possible[i];
}
return 0;
}
for (int i = 1; i <= n; i++)
{
cout << bfs(i);
}
}
