#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 200005;
vector <int> g[N];
int sz[N], ans[N];
int dfs(int i, int p) {
int s = sz[i];
for (int x : g[i]) {
if (x == p) continue;
s += dfs(x, i);
}
ans[i] = (s >= sz[p]);
return s;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i ++) cin >> sz[i];
for (int i = 1, u, v; i <= m; i ++) cin >> u >> v, g[min(u, v)].push_back(max(u, v));
dfs(1, 0);
for (int i = 1; i <= n; i ++) cout << ans[i];
return 0;
}
