#include <cstdio>
#include <algorithm>

#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

typedef long long ll;

const int mod = 1e9 + 7;

int add(int a, int b){
	return (a + b) % mod;
}
int mul(int a, int b){
	return ll(a) * b % mod;
}

int n, m;
int w[200];
int p[200][200];
int s[1001][1001];

int main(){
	scanf("%d%d", &n, &m);
	rep(i, n){
		scanf("%d", &w[i]);
	}
	rep(i, m){
		int a, b;
		scanf("%d%d", &a, &b);
		--a;
		--b;
		p[a][b] = min(w[a], w[b]);
	}

	rep(i, n){
		p[i][i] = w[i];
	}
	rep(k, n){
		rep(i, n){
			rep(j, n){
				p[i][j] = max(p[i][j], min(p[i][k], p[k][j]));
			}
		}
	}

	s[0][0] = 1;
	for(int i = 1; i <= 1000; ++i){
		rep(j, i + 1){
			s[i][j] = mul(j, add(s[i - 1][j], s[i - 1][j - 1]));
		}
	}

	int ans = 0;
	rep(i, n){
		rep(j, n){
			if(p[i][j] >= w[j]){
				ans = add(s[w[i]][w[j]], ans);
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}