#include<bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
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];
vector<bool> vis(n , 0);
pq.push({cur , x});
vector<int> possible;
while(!pq.empty())
{
auto [val , node] = pq.top();
pq.pop();
if(val >= cur)
{
possible.pb(node);
}
if(val > cur)
continue;
if(vis[node])
continue;
vis[node] = 1;
if(node != x)
cur+=val;
for(auto u : adj[node])
{
if(!vis[u] && a[u] == a[node])
possible.pb(u);
pq.push({a[u] , u});
}
}
bool acc = 1;
fore(i , n)
{
if(!vis[i])
{
acc = 0;
break;
}
}
if(acc)
{
for(auto u : possible)
ans[u] = 1;
ans[x] = 1;
}
else
{
fore(i , n)
{
if(vis[i])
ans[i] = 0;
}
ans[x] = 0;
}
}
signed main()
{
cin>>n>>m;
// n = 2e5 , m = n - 1;
vector<pair<int ,int>> ve;
fore(i , n)
{
cin>>a[i];
// a[i] = 1;
ve.pb({a[i] , i});
}
sort(ve.begin() , ve.end());
fore(i , m)
{
int u , v;
cin>>u>>v;
// u = i + 1 ;
// v = i + 2;
u-- , v--;
adj[u].pb(v);
adj[v].pb(u);
}
for(auto [val , i] : ve)
{
if(ans[i] == -1)
expand(i);
}
fore(i , n)
{
cout<<ans[i];
}
}
