#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
int s[200000];
vi adjList[200000];
vi S[200000];
int order[200000],parent[200000];
int find(int n) {
if (parent[n] != n) parent[n] = find(parent[n]);
return parent[n];
}
int seen[200000],ans[200000];
LLI ss[200000];
int main() {
int i;
int N,M;
int u,v;
scanf("%d %d",&N,&M);
for (i = 0; i < N; i++) scanf("%d",&s[i]);
for (i = 0; i < M; i++) {
scanf("%d %d",&u,&v);
u--,v--;
adjList[u].pb(v);
adjList[v].pb(u);
}
for (i = 0; i < N; i++) parent[i] = order[i] = i,S[i].pb(i),ss[i] = s[i];
sort(order,order+N,[&](int a,int b) { return s[a] < s[b]; });
for (i = 0; i < N; i++) {
int u = order[i];
seen[u] = 1;
for (int v: adjList[u]) {
if (seen[v]) {
if (find(u) != find(v)) {
int uu = find(u),vv = find(v);
if (ss[vv] < s[u]) S[vv].clear();
if (S[uu].size() > S[vv].size()) swap(uu,vv);
for (int x: S[uu]) S[vv].pb(x);
S[uu].clear(),parent[uu] = vv,ss[vv] += ss[uu];
}
}
}
}
for (int x: S[find(0)]) ans[x] = 1;
for (i = 0; i < N; i++) printf("%d",ans[i]);
printf("\n");
return 0;
}
