#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
int N, M, link[200005], sz[200005], mrk[200005], S[200005], off[200005];
vector<int> adj[200005], nodes[200005];
map<int, vector<int> > vec;
int find(int x) {
if (x == link[x]) return x;
return link[x] = find(link[x]);
}
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b) return;
if (sz[b] > sz[a]) swap(a, b);
sz[a] += sz[b];
S[a] += S[b];
for (int i : nodes[b]) {
mrk[i] += off[b] - off[a];
nodes[a].pb(i);
}
link[b] = a;
}
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> M;
for (int i = 1; i <= N; i++) {
cin >> S[i];
link[i] = i;
sz[i] = 1;
nodes[i].pb(i);
vec[S[i]].pb(i);
}
for (int i = 1, u, v; i <= M; i++) {
cin >> u >> v;
if (S[v] <= S[u]) adj[u].pb(v);
if (S[u] <= S[v]) adj[v].pb(u);
}
for (auto it = vec.begin(); it != vec.end(); ++it) {
for (auto i : it->second)
for (int j : adj[i]) {
if (S[find(j)] < it->first) off[find(j)]++;
unite(i, j);
}
}
for (int i = 1; i <= N; i++)
cout << (mrk[i] + off[find(i)] > 0 ? '0' : '1');
cout << '\n';
}
