#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<vector<int>> g(n);
while (m--) {
int u, v;
cin >> u >> v;
--u, --v;
g[u].push_back(v);
g[v].push_back(u);
}
for (int st = 0; st < n; st++) {
priority_queue<pair<int, int>> pq;
pq.emplace(-a[st], st);
vector<int> vis(n);
long long sum = 0;
while (!pq.empty()) {
auto [val, u] = pq.top();
pq.pop();
if (vis[u] || (sum < a[u] && sum)) continue;
vis[u] = 1;
sum += a[u];
for (int v : g[u]) {
pq.emplace(-a[v], v);
}
}
int s = accumulate(vis.begin(), vis.end(), 0);
cout << (s == n);
}
return 0;
}
