#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
int n, m;
int w[200];
vector<int> g[200];
ll comb[1001][1001], pw[1001][1001];
void calc(){
	comb[0][0]=comb[1][0]=comb[1][1]=1;
	for(int i=2; i<=1000; i++){
		comb[i][0]=comb[i][i]=1;
		for(int j=1; j<i; j++){
			comb[i][j]=(comb[i-1][j-1]+comb[i-1][j])%MOD;
		}
	}
	for(ll i=0; i<=1000; i++){
		pw[i][0]=1;
		for(int j=1; j<=1000; j++){
			pw[i][j]=pw[i][j-1]*i%MOD;
		}
	}
}
bool used[200];
void dfs(int x, int w0){
	used[x]=1;
	for(auto y:g[x]){
		if(w[y]<w0) continue;
		if(used[y]) continue;
		dfs(y, w0);
	}
}
ll count(int w1, int w2){
	ll ret=0;
	for(int i=0; i<w2; i++){
		if(i&1){
			ret-=(comb[w2][i]*pw[w2-i][w1]%MOD);
			ret+=MOD;
		}else{
			ret+=(comb[w2][i]*pw[w2-i][w1]);
		}
		ret%=MOD;
	}
	return ret;
}
int main()
{
	cin>>n>>m;
	for(int i=0; i<n; i++) cin>>w[i];
	for(int i=0; i<m; i++){
		int x, y; cin>>x>>y; x--; y--;
		g[y].push_back(x);
	}
	calc();
	ll ans=0;
	for(int i=0; i<n; i++){
		fill(used, used+n, 0);
		dfs(i, w[i]);
		for(int j=0; j<n; j++){
			if(used[j]){
				ans+=count(w[j], w[i]);
				ans%=MOD;
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}