#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define FOR(i, n) for (int i = 0; i < n; i++)
#define f first
#define s second
#define pb push_back
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()

using vi = vector<int>;
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using pull = pair<ull, ull>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = vector<vector<int>>;

int MOD = 1e9 + 7;

const int N = 2e5 + 7;
ll sil[N];
ll osil[N];

ll modpow(ll a, ll b)
{
    ll res = 1;
    while (b)
    {
        if (b & 1)
        {
            res = res * a % MOD;
        }
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

ll binom(int n, int k)
{
    if (k < 0 || k > n)
    {
        return 0;
    }
    return sil[n] * osil[k] % MOD * osil[n - k] % MOD;

}

void prep()
{
    sil[0] = 1;
    for (int i = 1; i < N; i++)
    {
        sil[i] = 1ll * sil[i - 1] * i % MOD;
    }
    osil[N - 1] = modpow(sil[N - 1], MOD - 2);
    for (int i = N - 2; i >= 0; i--)
    {
        osil[i] = 1ll * osil[i + 1] * (i + 1) % MOD;
    } 
}

void solve()
{
    int n, m;
    cin >> n >> m;
    prep();

    vvi G(n);

    vi tab(n);
    FOR (i, n)
    {
        cin >> tab[i];
    }

    FOR (i, m)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;

        G[a].pb(b);
        G[b].pb(a);
    }

    vi cols(n, -1);
    unordered_map<int, vi> by_col;
    bool dwudz;

    function<void(int, int)> dfs = [&](int start, int col ) {
        cols[start] = col;
        by_col[col].pb(start);

        for (int u : G[start])
        {
            if (cols[u] == -1)
            {
                dfs(u, col ^ 1);
            }
            else
            {
                if (cols[u] == cols[start])
                {
                    dwudz = false;
                }
            }
        }
    };

    ll spos = 1;
    FOR (i, n)
    {
        if (cols[i] == -1)
        {
            dwudz = true;
            by_col[0].clear();
            by_col[1].clear();
            dfs(i, 0);

            if (!dwudz)
            {
                
                int ile = sz(by_col[0]) + sz(by_col[1]);
                int czar = 0;
                for (int v : by_col[0])
                {
                    czar ^= tab[v];
                }
                for (int v : by_col[1])
                {
                    czar ^= tab[v];
                }

                // cout << "NIEDUWIEDLNY " << ile << ' ' << czar << endl;
                ll teraz = 0;
                for (int c = czar; c <= ile; c += 2)
                {
                    teraz += binom(ile, c);
                    teraz %= MOD;
                }
                // cout << "TERAZ " << teraz << endl;
                spos = spos * teraz % MOD;
            }
            else
            {
                int b1 = 0, c1 = 0, b2 = 0, c2 = 0;

                for (auto & u : by_col[0])
                {
                    if (tab[u] == 0)
                    {
                        b1++;
                    }
                    else
                    {
                        c1++;
                    }
                }

                for (auto & u : by_col[1])
                {
                    if (tab[u] == 0)
                    {
                        b2++;
                    }
                    else
                    {
                        c2++;
                    }
                }

                // cout << "DWUDZIELNY " << b1 << ' ' << c1 << ' ' << b2 << ' ' << c2 << endl;

                int w_dol = min(c1, c2);
                int w_gore = min(b1, b2);

                ll teraz = 0;
                for (int diff = -w_dol; diff <= w_gore; ++diff)
                {
                    teraz += 1ll * binom(sz(by_col[0]), c1 + diff) * binom(sz(by_col[1]), c2 + diff);
                    teraz %= MOD;
                }
                // cout << "TERAZ " << teraz << endl;
                spos = spos * teraz % MOD;
            }
        }
    }

    cout << spos << '\n';
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int tests = 1;
    // cin >> tests;

    for (int test = 1; test <= tests; test++)
    {
        solve();
    }

    return 0;
}