#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf = 1e9;
const int mod2 = 1e9 + 7;
const int mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
if(x+y<0) x+=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c;
};
struct id
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r;
int kk;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
// fou(task);
}
NHP
/// cin>>s1;
// modwwe
phongbeo(),down
// checktime
}
bool cmp(ib a,ib b)
{
return a.a<b.a;
}
vector<int> v[200001];
bool c[200001];
ib a[200001];
struct dshi
{
vector<int> v[200001];
ic dsu[200001];
void init()
{
for(int i=1; i<=n; i++)
dsu[i]= {1,i,a[i].a},v[i].pb(i);
}
int get(int x)
{
if(dsu[x].b!=x)return dsu[x].b=get(dsu[x].b);
return x;
}
void noi(int x,int y)
{
x=get(x);
y=get(y);
if(x==y) return;
if(v[x].size()<v[y].size())swap(x,y);
for(auto f:v[y])
v[x].pb(f);
if(dsu[x].a<dsu[y].a)swap(v[x],v[y]),swap(x,y);
dsu[x].a+=dsu[y].a;
dsu[x].c+=dsu[y].c;
dsu[y].b=x;
vector<int>().swap(v[y]);
}
void del(int x)
{
x=get(x);
for(auto f:v[x])
c[f]=1;
vector<int>().swap(v[x]);
}
}ds;
void phongbeo()
{
cin>>n>>m;
for(int i=1; i<=n; i++)cin>>a[i].a,a[i].b=i;
for(int i=1; i<=m; i++)
{
cin>>l>>r;
if(a[l].a>=a[r].a)v[l].pb(r);
else v[r].pb(l);
}
ds.init();
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++)
{
for(auto x:v[a[i].b])
{
s2=ds.get(x);
if(ds.dsu[s2].c<a[i].a)
{
ds.del(s2);
}
}
for(auto x:v[a[i].b])
{
ds.noi(a[i].b,x);
}
}
for(int i=1;i<=n;i++)
cout<<1-c[i];
}
