#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 3005
#define ll long long
#define mod 1000000007
#define inv2 500000004
void Read(int &p)
{
	p = 0;
	char c = getchar();
	for (; c < '0' || c > '9'; c = getchar());
	for (; c >= '0' && c <= '9'; c = getchar())p = p * 10 + c - '0';
}
int n, q;
int f[N][N], A[N];
int main()
{
	Read(n), Read(q);
	for (int i = 1; i <= n; i++)
		Read(A[i]);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			f[i][j] = (A[i] > A[j]);
	int ans = 1;
	for (; q--; )
	{
		ans = (ans << 1) % mod;
		int x, y;
		Read(x), Read(y);
		for (int i = 1; i <= n; i++)
		{
			if (i != x && i != y)
			{
				f[i][x] = f[i][y] = (ll)(f[i][x] + f[i][y]) * inv2 % mod;
				f[x][i] = f[y][i] = (ll)(f[x][i] + f[y][i]) * inv2 % mod;
			}
		}
		f[x][y] = f[y][x] = (ll)(f[x][y] + f[y][x]) * inv2 % mod;
	}
	int sum = 0;
	for (int i = 1; i <= n; i++)
		for (int j = i + 1; j <= n; j++)
			sum = (sum + f[i][j]) % mod;
	ans = (ll)sum * ans % mod;
	printf("%d\n", ans);
}
//