#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<sstream>
#include<bitset>
#include<numeric>
#include<climits>
#include<complex>
using namespace std;

typedef long long ll;

template<typename A,typename B>inline void chmin(A &a, B b) { if (a > b)a = b; }
template<typename A,typename B>inline void chmax(A &a, B b) { if (a < b)a = b; }

const int mod = 1000000007;

int N, M;
int W[200];

int f[200][200];
int dp[1010][1010];

signed main() {
	cin >> N >> M;
	for (int i = 0; i < N; i++)cin >> W[i];

	for (int i = 0; i < N; i++)f[i][i] = W[i];

	for (int i = 0; i < M; i++) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		f[a][b] = min(W[a], W[b]);
	}

	for (int k = 0; k < N; k++) {
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				chmax(f[i][j], min(f[i][k], f[k][j]));
			}
		}
	}

	dp[1][1] = 1;
	for (int i = 2; i <= 1000; i++) {
		for (int j = 1; j <= 1000; j++) {
			dp[i][j] = (ll)j*(dp[i - 1][j - 1] + dp[i - 1][j]) % mod;
		}
	}

	int ans = 0;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (f[i][j] >= W[j])ans = (ans + dp[W[i]][W[j]]) % mod;
		}
	}
	cout << ans << endl;
	return 0;
}