#include <bits/stdc++.h>
using namespace std;
const int N = int(2e5) + 9;
int a[N];
int good[N];
vector<int> g[N];
int64_t sum[N];
void dfs(int u, int p) {
sum[u] = a[u];
for (int v : g[u]) {
if (v == p) continue;
dfs(v, u);
sum[u] += sum[v];
}
}
void check(int u, int p) {
good[u] = good[p] & (sum[u] >= a[p]);
for (int v : g[u]) {
if (v == p) continue;
check(v, u);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
while (m--) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1, 0);
good[0] = 1;
check(1, 0);
for (int i = 1; i <= n; i++) {
cout << good[i];
}
return 0;
}
