1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define rep(i, a, b) for(int i = a; i < (b); ++i)

#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define ssize(x) int(x.size())

#define pb push_back
#define fi first
#define se second
#define ld long double

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair <ld, ld> pd;

using LL=long long;

#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "()" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
    o << "{";int i = 0;
    for(auto e : x) o << ", "+!i++<<e;
    return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif

const int MOD = 1e9 + 7;

void solve() {
    int N, M;
    cin >> N >> M;

    vector<int> c(N);
    REP(i, N) cin >> c[i];

    vector<pii> switches(M);
    REP(i, M)  {
        cin >> switches[i].fi >> switches[i].se;
        switches[i].fi--;
        switches[i].se--;
    }

    auto solve = [&]() {
        ll res = 1;

        set< vector<int> > every;
        every.insert(c);

        set< vector<int> > new_masks;
        new_masks.insert(c);

        while (not new_masks.empty()) {
            set< vector<int> > holder;

            for (auto mask : new_masks) {
                vector<int> mask_cpy;

                for (auto s : switches) {
                    int a = s.fi, b = s.se;

                    if (mask[a] == mask[b]) {
                        if (mask_cpy.empty()) mask_cpy = mask;

                        mask_cpy[a] ^= 1;
                        mask_cpy[b] ^= 1;
                        
                        holder.insert(mask_cpy);
                        
                        mask_cpy[a] ^= 1;
                        mask_cpy[b] ^= 1;
                    }
                }

            }

            new_masks.clear();

            for (auto mask : holder) {
                if (every.find(mask) == every.end()) {
                    every.insert(mask);
                    new_masks.insert(mask);
                }
            }

            res = (res + new_masks.size()) % MOD;
        }

        return res;
    };

    cout << solve() << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
}