#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define FORD(x,y,z) for(int x=y;x>=z;x--)
#define MSET(x,y) memset(x,y,sizeof(x))
#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 1005
void RI(){}
template<typename... T>
void RI( int& head, T&... tail ) {
    scanf("%d",&head);
    RI(tail...);
}
using namespace std;
typedef long long LL;
int n,m,in[M];
LL frac[M],c[M][M],dp[M][M],ans,MOD = 1000000007;
bool con[M][M],vis[M],edg[M][M];

LL pw(int x,int y)
{
	LL re=1, tmp=x;
	while(y)
	{
		if(y&1) re=re*tmp%MOD;
		tmp = tmp*tmp%MOD;
		y>>=1;
	}
	return re;
}
void add(int x,int y) //x->y
{
	ans += dp[x][y];
//printf("add %lld\n",dp[x][y]);
return;
	if(x<y) return;

//	printf("add %d %d\n",x,y);
	LL tmp = c[x][y];
	tmp = tmp*frac[y] % MOD;
	if(x>y) tmp = tmp*pw(x-y, y) % MOD;

	printf("add %lld\n",tmp);
	ans = (ans+tmp)%MOD;
}
void dfs(int cur,int l)
{
	vis[cur] =true;
	REP(i,1,n) if(!vis[i] && edg[cur][i] && in[i]>=l)
		dfs(i, l);
}
int main()
{
	frac[0]=1;
	REP(i,1,M-1) frac[i] = (frac[i-1]*i) % MOD;
	REP(i,0,M-1)
	{
		c[i][0] = 1;
		REP(j,1,i) c[i][j] = (c[i-1][j] + c[i-1][j-1]) % MOD;
	}

	REP(i,1,1004)
	{
		LL sum=0;

		dp[i][1] = sum = 1;

		REP(j,2,i)
		{
			dp[i][j] = j*(dp[i-1][j] + dp[i-1][j-1]);
			dp[i][j] %= MOD;
		}
	}

	int x,y;
	while(~scanf("%d %d",&n,&m))
	{
		ans=0;
		MSET(con, false);
		MSET(edg, false);
		
		REP(i,1,n) RI(in[i]);
		REP(i,1,m)
		{
			RI(x,y);
			edg[y][x] = true;
		}

		REP(ed,1,n)
		{
			MSET(vis, false);
			dfs(ed, in[ed]);

			REP(i,1,n) if(vis[i]) con[i][ed] = true;
		}

		REP(i,1,n)REP(j,1,n) if(con[i][j])
		{
		//	printf("i=%d j=%d ",i,j);
			add(in[i], in[j]);
		}
		printf("%lld\n",ans);
	}
	
	return 0;
}