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
//2024-03-16
//author: Marcin Rolbiecki
#include <bits/stdc++.h>
using namespace std;

const int maxN = 2e5+2, maxM = 4e5+2, mod = 1e9+7;

int n, m;
vector <int> c;
int a[maxM], b[maxM];

set <vector<int>> S;

void dfs (vector <int> stan)
{
	if (S.count(stan)) return;
	else S.insert(stan);
	
	for (int i = 1; i <= m; i++)
	{
		if (stan[ a[i] ] == stan[ b[i] ])
		{
			auto nowystan = stan;
			nowystan[ a[i] ] ^= 1;
			nowystan[ b[i] ] ^= 1;
			dfs(nowystan);
		}
	}
}

int main ()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	c.resize(n+1);
	
	for (int i = 1; i <= n; i++)
	{
		cin >> c[i];
	}
		
	for (int i = 1; i <= m; i++)
	{
		cin >> a[i] >> b[i];
	}
		
	dfs(c);
	
	cout << S.size() % mod;
	
	return 0;
}