#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;

#define range(i,a,b) for(int i=(a); i < (b); i++)
#define rep(i,n) range(i,0,n)
#define P 1000000007
#define W 1001

LL C[W][W],F[W][W];
int w[W-1],V[W][W];
vector < vector <int> > E;
LL mpow(LL b,LL e){LL r=1;for(;e>0;e>>=1){if(e&1)r=r*b%P;b=b*b%P;}return r;}
LL calc(LL a,LL b){LL r=0;rep(k,b)r=(r+(k%2?-1:1)*C[b][k]*mpow(b-k,a)%P+P)%P;return r;}
int main(){
	int N,M,x,y,h,m;LL A=0;
	priority_queue <PII, vector<PII> > Q;
	C[0][0]=1;
	rep(i,W-1)rep(j,i+1){C[i+1][j]=(C[i][j]+C[i+1][j])%P;C[i+1][j+1]=(C[i][j]+C[i+1][j+1])%P;}
	rep(i,W)rep(j,W)F[i][j]=V[i][j]=0;
	scanf("%d%d",&N,&M);
	E.resize(N);
	rep(i,N)scanf("%d",w+i);
	rep(i,M){scanf("%d%d",&x,&y);E[--x].push_back(--y);}
	rep(s,N){
		Q.push(PII(w[s],s));
		while(Q.size()){
			PII t=Q.top();Q.pop();
			m=t.first;h=t.second;
			if(m<=V[s][h])continue;
			V[s][h]=m;
			if(w[s]>=w[h]&&w[h]<=m)F[w[s]][w[h]]++;
			m=min(m,w[h]);
			for(auto it:E[h])Q.push(PII(m,it));
		}
	}
	rep(i,W)rep(j,i+1)if(F[i][j]>0){A=(A+F[i][j]*calc(i,j))%P;}
	printf("%lld\n",A);
	return 0;
}