#include <iostream>
#include <algorithm>
#include <vector>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e5 + 10;

int n, m, odr[MAXN], idx[MAXN];
bool ans[MAXN];
ll s[MAXN];
vector <int> e[MAXN], re[MAXN];

int fa[MAXN];
vector <int> res[MAXN];
bool avl[MAXN];
int Find(int k) {return k == fa[k] ? k : fa[k] = Find(fa[k]);}
inline void Union(int u, int v)
{
    u = Find(u), v = Find(v);
    if (u == v) return;
    if (res[u].size() < res[v].size()) swap(u, v);
    fa[v] = u, s[u] += s[v];
    for (auto x : res[v]) res[u].push_back(x);
}
inline void Union2(int u, int v)
{
    u = Find(u), v = Find(v);
    if (u == v) return;
    fa[v] = u, s[u] += s[v];
}

int main()
{
    // freopen("B.in", "r", stdin);
    // freopen("B.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m);
    for (int i = 1; i <= n; i++) Read(s[i]), odr[i] = i;
    sort(odr + 1, odr + n + 1, [&](int x, int y) {return s[x] < s[y];});
    for (int i = 1; i <= n; i++) idx[odr[i]] = i;
    for (int i = 1, u, v; i <= m; i++)
    {
        Read(u), Read(v);
        if (idx[u] < idx[v]) swap(u, v);
        e[u].push_back(v), re[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) fa[i] = i, res[i].push_back(i);
    for (int i = 1; i <= n; i++)
    {
        int u = odr[i];
        // cout << u << "\n";
        for (auto v : e[u])
        {
            if (Find(u) == Find(v)) continue;
            // cout << u << ' ' << v << " E\n";
            // cout << s[Find(v)] << " " << s[Find(u)] << "\n";
            if (s[Find(v)] >= s[Find(u)]) avl[v] = 1;
        }
        for (auto v : e[u])
        {
            if (Find(u) == Find(v)) {avl[v] = 0; continue;}
            if (avl[v]) Union(u, v), avl[v] = 0;//, cout << u << " " << v << " #\n";
            else Union2(u, v);
        }
        // for (int j = 1; j <= n; j++, cout << "\n")
        // {
        //     cout << j << " " << s[j] << ":\n";
        //     for (auto x : res[j]) cout << x << ' ';
        // }
            
        // cout << "\n";
    }
    for (auto x : res[Find(odr[n])]) ans[x] = 1;
    for (int i = 1; i <= n; i++) cout << ans[i];
    return 0;
}