#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define pb push_back
#define fore(i , n) for(int i = 0 ; i<n;i++)
#define forr(i , x , y) for(int i = x ; i <= y; i++)
#define forn(i , x , y) for(int i = x ; i >= y; i--)
const int N = 2e5 + 10;
vector<int> adj[N];
int a[N];
int n , m;
vector<int> ans(N , -1);
void expand(int x)
{
priority_queue<pair<int ,int> , vector<pair<int ,int>> , greater<pair<int , int>>> pq;
int cur = a[x];
pq.push({cur , x});
gp_hash_table<int , int> vis;
while(!pq.empty())
{
auto [val , node] = pq.top();
pq.pop();
if(val > cur)
break;
if(vis.find(node) != vis.end())
continue;
vis[node] = 1;
if(node != x)
cur+=val;
if(ans[node] == 1)
{
ans[x] = 1;
return;
}
for(auto u : adj[node])
{
pq.push({a[u] , u});
}
}
bool acc = 1;
if((int)vis.size() != n)
acc = 0;
if(acc)
{
ans[x] = 1;
}
else
{
for(auto p : vis)
{
ans[p.first] = 0;
}
ans[x] = 0;
}
}
signed main()
{
n = 2e5 , m = n - 1;
cin>>n>>m;
vector<pair<int ,int>> ve;
fore(i , n)
{
a[i] = rand()%10;
cin>>a[i];
ve.pb({a[i] , i});
}
sort(ve.begin() , ve.end());
fore(i , m)
{
int u , v;
u = i + 1 ;
v = i + 2;
cin>>u>>v;
u-- , v--;
adj[u].pb(v);
adj[v].pb(u);
}
int cnt = 0;
for(auto [val , i] : ve)
{
if(ans[i] == -1)
{
cnt++;
expand(i);
}
}
fore(i , n)
{
cout<<ans[i];
}
}
