#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(v) v.begin(),v.end()
#define FILE(v) freopen(v".inp", "r", stdin),freopen(v".out", "w", stdout)
#define int ll
typedef long long ll;
typedef long double ld;
///------------------------------------------------///
/// VARIABLE
const int MAXN = 2e5 + 5;
int a[MAXN];
int n, m;
vector<int> adj[MAXN];
map<int, vector<int>> mp;
map<int, vector<int>> ver;
int parent[MAXN], sz[MAXN], sum[MAXN];
int ans[MAXN];
/// FUNCTIONS
int getParent(int x)
{
if (x == parent[x]) return x;
return parent[x] = getParent(parent[x]);
}
bool joinDsu(int u, int v)
{
u = getParent(u);
v = getParent(v);
if (u == v) return false;
if (sz[u] < sz[v]) swap(u, v);
parent[v] = u;
sz[u] += sz[v];
sum[u] += sum[v];
return true;
}
/// PROCESS
void read()
{
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++)
{
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
}
void solve()
{
for (int i = 1; i <= n; i++) ans[i] = 1;
for (int i = 1; i <= n; i++) parent[i] = i, sz[i] = 1, sum[i] = a[i];
for (int i = 1; i <= n; i++)
{
mp[a[i]].pb(i);
ver[a[i]].pb(i);
}
for (auto cur : mp)
{
for (int u : ver[cur.first])
{
for (int v : adj[u]) if (a[u] <= cur.first && a[v] <= cur.first)
{
joinDsu(u, v);
}
for (int u : cur.second)
{
int nWeight = sum[getParent(u)];
if (nWeight > cur.first) mp[nWeight].pb(u);
else
{
ans[u] = 0;
}
}
}
}
for (int i = 1; i <= n; i++) cout << ans[i];
cout << '\n';
}
/// MAIN
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
// FILE("test");
int T = 1;
bool multitest = false;
if (multitest) cin >> T;
double st = clock();
while (T--)
{
read();
solve();
}
double en = clock();
cerr << fixed << setprecision(3) << (en - st) / CLOCKS_PER_SEC;
return 0;
}
