// Bolatulu
#include <bits/stdc++.h>
// #include <art.h>
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define eb emplace_back
#define ins insert
#define F first
#define S second
#define md (tl+tr)/2
#define TL v+v,tl,md
#define TR v+v+1,md+1,tr
#define Tl t[v].l,tl,md
#define Tr t[v].r,md+1,tr
#define all(x) (x).begin(),(x).end()
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define int long long
// #define file(s) freopen(s".in", "r", stdin); freopen(s".out", "w", stdout);
using namespace std;
int binpow(int a,int n,int M) {
if (n==0)
return 1;
if (n%2!=0)
return (a * binpow(a,n-1,M))%M;
int z=binpow(a,n/2,M);
return (z*z)%M;
}
const ll INF = 1e18+7;
const int N = 2e5+7;
int n,m,s[N],ans[N],sum;
vector <int> g[N];
bool u[N];
void solve() {
cin >> n >> m;
for (int i=1;i<=n;i++) {
cin >> s[i];
}
while (m--) {
int u,v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
for (int i=1;i<=n;i++) {
sum=s[i];
int c=0;
for (int j=1;j<=n;j++)
u[j]=false;
set <pair <int,int>> q;
q.ins({0,i});
u[i]=true;
while (!q.empty()) {
pair <int,int> pp=*q.begin();
if (sum<pp.F)
break;
c++;
sum+=pp.F;
int v=pp.S;
q.erase(q.begin());
for (auto to : g[v]) {
if (!u[to]) {
u[to]=true;
q.ins({s[to],to});
}
}
}
if (c==n)
ans[i]=1;
else
ans[i]=0;
}
for (int i=1;i<=n;i++) {
cout << ans[i];
}
}
signed main() {
// file("jenga");
ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int test = 1;
// cin >> test;
while (test--) {
solve();
if (test)
cout << '\n';
}
return 0;
}
