#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#define LL long long
using namespace std;
const LL mod=1e9+7;
LL n,q,a[3010],Q;
LL f[3010][3010];
LL fp(LL a,LL b)
{
	LL ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		a=a*a%mod;b>>=1;
	}
	return ans;
}
const LL inv=fp(2,mod-2);
int main()
{
	scanf("%lld %lld",&n,&q);Q=q;
	for(LL i=1;i<=n;i++) scanf("%lld",&a[i]);
	for(LL i=1;i<=n;i++)
		for(LL j=1;j<=n;j++) f[i][j]=(a[i]<a[j]);
	while(q--)
	{
		LL x,y;scanf("%lld %lld",&x,&y);
		f[x][y]=f[y][x]=(f[x][y]+f[y][x])*inv%mod;
		for(LL i=1;i<=n;i++)
			if(i!=x&&i!=y)
			{
				f[i][x]=f[i][y]=(f[i][x]+f[i][y])*inv%mod;
				f[x][i]=f[y][i]=(f[x][i]+f[y][i])*inv%mod;
			}
	}
	LL ans=0;
	for(LL i=1;i<=n;i++)
		for(LL j=1;j<i;j++) (ans+=f[i][j])%=mod;
	(ans*=fp(2,Q))%=mod;
	printf("%lld",ans);
}