#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int32_t main() {
setIO();
int n, m;
cin >> n >> m;
vector<int> val(n+1);
for(int i=1; i<=n; i++) cin >> val[i];
vector<vector<int> > graph(n+1);
for(int i=0; i<m; i++) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
auto dijkstra = [&](int a) {
//cout << a << ": \n";
int cnt = 0;
ll total = 0;
vector<bool> vis(n+1);
priority_queue<pll, vector<pll>, greater<pll> > pq;
pq.push({ 0, a });
while(!pq.empty()) {
int u = pq.top().second;
pq.pop();
//cout << u << '\n';
if(vis[u] || (total < val[u] && u != a)) continue;
vis[u] = true;
total += val[u];
cnt++;
for(int &v : graph[u]) {
if(vis[v]) continue;
pq.push({ val[v], v });
}
}
return (cnt == n);
};
for(int i=1; i<=n; i++)
cout << dijkstra(i);
return 0;
}
