#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>

using namespace std;

const int mod = 1000000007;

long long qpow(long long base,int tms)
{
	long long tmp = 1;
	while(tms)
	{
		if(tms & 1) tmp = tmp * base % mod;
		base = base * base % mod;
		tms >>= 1;
	}
	return tmp;
}

long long inv2 = qpow(2,mod - 2);
long long dp[3050][3050];
int N,Q;
int seq[3050];

int main()
{
	scanf("%d%d",&N,&Q);
	for(int i = 1;i <= N; ++ i)
		scanf("%d",&seq[i]);
	for(int i = 1;i <= N; ++ i)
		for(int j = 1;j <= N; ++ j)
			dp[i][j] = seq[i] > seq[j];
	long long make_me_burn = qpow(2,Q);
	while(Q --)
	{
		int x,y; scanf("%d%d",&x,&y);
		dp[x][y] = dp[y][x] = (dp[x][y] + dp[y][x]) * inv2 % mod;
		for(int i = 1;i <= N; ++ i)
			if(i != x && i != y)
				dp[i][x] = dp[i][y] = (dp[i][x] + dp[i][y]) * inv2 % mod,
				dp[x][i] = dp[y][i] = (dp[x][i] + dp[y][i]) * inv2 % mod;
	}
	long long ans = 0;
	for(int i = 1;i <= N; ++ i)
		for(int j = i + 1;j <= N; ++ j)
			ans = ans + dp[i][j] * make_me_burn % mod,ans %= mod;
	printf("%lld\n",ans);
}