#include <iostream>
#include <cstdio>
#define int long long
using namespace std;
const int N = 3e3 + 5;
const int mod = 1e9 + 7;
int n, Q, f[N][N], a[N], inv2, pow = 1, ans = 0;
inline int read()
{
	int x = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9') {x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar();}
	return x * f;
}
signed main()
{
	n = read(); Q = read();
	for(int i = 1; i <= n; i ++) a[i] = read();
	for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++) f[i][j] = (a[i] < a[j]);
	inv2 = (mod + 1) / 2;
	for(int i = 1, x, y; i <= Q; i ++)
	{
		x = read(); y = read(); pow = pow * 2 % mod;
		f[x][y] = f[y][x] = (f[x][y] + f[y][x]) % mod * inv2 % mod;
		for(int j = 1; j <= n; j ++)
		{
			if(j == x || j == y) continue;
			f[x][j] = f[y][j] = (f[x][j] + f[y][j]) % mod * inv2 % mod;
			f[j][x] = f[j][y] = (f[j][x] + f[j][y]) % mod * inv2 % mod;
		}
	}
	for(int i = 1; i <= n; i ++) for(int j = i - 1; j >= 1; j --) ans = (ans + f[i][j]) % mod;
	printf("%lld\n", ans * pow % mod);
	return 0;
}
