#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
const int MAX = 2e5 + 5;
int numNode, numEdge;
struct Edge{
int u, v, w;
Edge(){}
Edge(int _u, int _v, int _w): u(_u), v(_v), w(_w){}
int other(int x){ return (u ^ v ^ x); }
bool operator < (const Edge& oth) const{
return w < oth.w;
}
} edge[MAX];
int label[MAX];
int par[MAX], sz[MAX], sum[MAX];
bool bad[MAX];
int find(int u){
if(u == par[u]) return u;
int v = find(par[u]);
bad[u] |= bad[par[u]];
return par[u] = v;
}
bool unite(int u, int v){
u = find(u), v = find(v);
if(u == v) return false;
if(label[u] < label[v]) swap(u, v);
if (label[u] > sum[v]) bad[v] = 1;
sum[u] += sum[v];
par[v] = u;
return true;
}
void Whisper(){
cin >> numNode >> numEdge;
for (int i = 1; i <= numNode; ++i) cin >> label[i];
FOR(i, 1, numNode){
par[i] = i, sz[i] = 1, sum[i] = label[i];
}
vector<Edge> ed;
for (int i = 1; i <= numEdge; ++i){
cin >> edge[i].u >> edge[i].v;
int w = max(label[edge[i].u], label[edge[i].v]);
ed.push_back(Edge(edge[i].u, edge[i].v, w));
}
sort(ed.begin(), ed.end());
for (int i = 0; i < numEdge; ++i){
int u = ed[i].u, v = ed[i].v;
unite(u, v);
}
for (int i = 1; i <= numNode; ++i){
find(i);
cout << !bad[i];
}
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
