#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m;
vector<ll> par, sz, val, a;
vector<vector<ll>> e;
vector<bool> spreadable, inGraph;
map<ll, vector<ll>> mp;
void make_sets() {
par.assign(n, 0);
iota(par.begin(), par.end(), 0);
sz.assign(n, 1);
val = a;
}
ll find_set(ll a) {
if (par[a] == a) return a;
return par[a] = find_set(par[a]);
}
ll set_val(ll a) { return val[find_set(a)]; }
void union_set(ll a, ll b) {
a = find_set(a);
b = find_set(b);
if (a == b) return;
if (sz[a] > sz[b]) swap(a, b);
par[a] = b;
sz[b] += sz[a];
val[b] += val[a];
}
void make_unspreadable(ll& u){
spreadable[u] = false;
for(auto& v : e[u]){
if(!inGraph[v]) continue;
if(spreadable[v]) make_unspreadable(v);
}
}
int main() {
cin >> n >> m;
a.resize(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]].push_back(i);
}
make_sets();
e.resize(n);
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
a--;
b--;
e[a].push_back(b);
e[b].push_back(a);
}
spreadable.assign(n,true);
inGraph.assign(n,false);
for(auto& [num, vec] : mp) {
for(auto& u : vec) {
for(auto& v : e[u]) {
if(!inGraph[v]) continue;
if(set_val(v) < num){
make_unspreadable(v);
}
union_set(u, v);
}
inGraph[u] = true;
}
}
for(ll i = 0; i < n; i++) {
cout << ll(spreadable[i]);
}
cout << endl;
}
