#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#define int long long
using namespace std;
signed main(){
int n, m; cin >> n >> m;
vector<int> inh;
vector<vector<int>> cons; cons.resize(n);
int s;
for (int reader = 0; reader < n; ++reader) {
cin >> s;
inh.push_back(s);
}
int a, b;
for (int reader = 0; reader < m; ++reader) {
cin >> a >> b; a--; b--;
cons[a].push_back(b);
cons[b].push_back(a);
}
//vector<bool> rall (n);????????????????
vector<bool> poss; poss.resize(n, true);
vector<int> group (n); for(int i = 0; i < n; i++) group[i] = i;
vector<int> sum = inh;
vector<set<int>> isin;isin.resize(n); for(int i = 0; i < n; i++) isin[i].insert(i);
auto get = [&](int u){
int s = u;
while(group[u] != u) u = group[u];
while(group[s] != s){
int beg = group[s];
group[s] = u;
s = group[beg];
}
return u;
};
auto unite = [&](int u, int v){
u = get(u); v = get(v);
if (u==v) return;
if(isin[u].size() < isin[v].size()) swap(u, v);
group[v] = u;
sum[u] += sum[v];
for(int ins : isin[v]) isin[u].insert(ins);
};
vector<int> scanl (n); for (int i = 0; i < n; ++i) scanl[i] = i;
auto compinh = [&](int r, int s) {return inh[r] < inh[s];};
sort(scanl.begin(), scanl.end(), compinh);
for (int scanner : scanl) {
for(int c : cons[scanner]){
if(inh[c] <= inh[scanner]){
if(sum[get(c)] < inh[scanner]){
for(int killer : isin[get(c)]) poss[killer] = false;
isin[get(c)].clear();
}
unite(c, scanner);
}
}
}
for(bool printr : poss) cout << printr;
return 0;
}
