#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pli = pair<ll, int>;
using vi = vector<int>;
using vl = vector<ll>;
#define F first
#define S second
#define PB push_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
const int MXN = 2e5+5;
int n, m;
ll A[MXN];
vi adj[MXN];
vi res_adj[MXN]; // directional graph describes how I propagate results
struct DSU {
int n;
vi par;
vi sz;
vi mx_id;
vl pop;
void init(int _n) {
n = _n;
par = vi(n+1);
sz = vi(n+1, 1);
mx_id = vi(n+1);
pop = vl(n+1);
iota(par.begin()+1, par.begin()+n+1, 1);
iota(mx_id.begin()+1, mx_id.begin()+n+1, 1);
for(int i = 1; i <= n; i++) pop[i] = A[i];
}
int find_set(int u) { return par[u] == u ? u : par[u] = find_set(par[u]); }
void unite(int u, int v) {
u = find_set(u), v = find_set(v);
if(u == v) return;
if(sz[u] < sz[v]) swap(u, v);
if(A[mx_id[u]] < A[mx_id[v]]) mx_id[u] = mx_id[v];
par[v] = u;
sz[u] += sz[v];
pop[u] += pop[v];
}
};
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> A[i];
for(int i = 0; i < m; i++) {
int u, v; cin >> u >> v; adj[u].PB(v), adj[v].PB(u);
}
string ans(n+1, '0');
ll mx = *max_element(A+1, A+n+1);
vector<pli> B;
for(int i = 1; i <= n; i++) {
if(A[i] == mx) ans[i] = '1';
B.PB({A[i], i});
}
sort(all(B));
DSU dsu;
dsu.init(n);
for(auto p : B) {
int u = p.S;
for(int v : adj[u]) {
if(A[v] <= A[u]) {
if(dsu.pop[dsu.find_set(v)] >= A[u]) {
res_adj[u].PB(dsu.mx_id[dsu.find_set(v)]);
}
}
}
for(int v : adj[u]) {
if(A[v] <= A[u]) {
dsu.unite(u, v);
}
}
}
queue<int> Q;
for(int i = 1; i <= n; i++) if(ans[i] == '1') Q.push(i);
while(!Q.empty()) {
int i = Q.front();
Q.pop();
for(int j : res_adj[i]) {
if(ans[j] == '0') {
ans[j] = '1';
Q.push(j);
}
}
}
cout << ans.substr(1) << "\n";
return 0;
}
/*
4 4
2 2 4 3
1 2
1 3
2 3
3 4
ans: 1110
4 3
4 2 2 1
1 2
3 2
4 1
ans: 1110
*/
