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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template<class T> using ordered_set =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;

#define debug(x) cout << "[" <<  #x << " " << x << "] ";

#define ar array
#define ll long long
#define ld long double
#define sz(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()

typedef vector<int> vi;
typedef pair<int,int> pi;

const int MAX_N = 2e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;

vector<pi> switches;
unordered_set<string> vis;

ll qexp(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 res = 0;
void brute_force(string &a){
    if(vis.count(a))return;
    vis.insert(a);
    res = (res +1)%MOD;
    for(pi sw : switches){
        if(a[sw.first] == a[sw.second]){
            if(a[sw.first] == '1'){
                a[sw.first] = '0';
                a[sw.second] = '0';
            }
            else{
                a[sw.first] = '1';
                a[sw.second] = '1';
            
            }
            brute_force(a);
            if(a[sw.first] == '1'){
                a[sw.first] = '0';
                a[sw.second] = '0';
            }
            else{
                a[sw.first] = '1';
                a[sw.second] = '1';
            }
        }
    }
}

void solve() {
  int n, m;
  std::cin >> n >> m;
  vi a(n);
  for(auto &x : a)std::cin >> x;
  string s;
  for(int i = 0; i < n; i++){
    s += to_string(a[i]);
  }
  while(m--){
    int u, v;
    cin >> u >> v;
    switches.push_back({min(u,v)-1, max(u,v)-1});
  }
  brute_force(s);
  cout << res << "\n";

}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int tc = 1;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t << ": ";
        solve();
    }
}