#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define FILL(a, b, T) fill_n((T *)a, sizeof(a) / sizeof(T), b)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long;

const ll mod = 1e9 + 7;
ll C[1010][1010], F[1010], Z[1010][1010];

ll modpow(ll a, ll b, ll mod) {
	if (b == 0) return 1;
	return modpow(a * a % mod, b / 2, mod) * (b & 1 ? a : 1) % mod;
}

ll count(ll n, ll k) {
	if (Z[n][k] != -1) return Z[n][k];
	ll res = 0;
	rep (i, 1, k + 1) {
		ll v = C[k][i] * modpow(i, n, mod) % mod;
		if ((k + i) % 2 == 1) v *= -1;
		(res += v) %= mod;
	}
	res %= mod; res += mod; res %= mod;
	return Z[n][k] = res;
}

vector<int> g[222];
const int inf = 1e9;
int w[222];

int main() {
	memset(Z, -1, sizeof(Z));

	F[0] = 1;
	rep (i, 1, 1010) F[i] = F[i - 1] * i % mod;

	C[0][0] = 1;
	rep (i, 1, 1010) {
		C[i][0] = 1;
		rep (j, 1, 1010) {
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
		}
	}

	int n, m;
	cin >> n >> m;
	rep (i, n) cin >> w[i];
	rep (i, m) {
		int u, v;
		cin >> u >> v;
		u--; v--;
		g[u].push_back(v);
	}

	ll ans = 0;
	rep (i, n) {
		priority_queue<pair<int, int>> q;
		q.emplace(0, i);
		vector<int> dist(n, 0);
		dist[i] = w[i];
		while (!q.empty()) {
			int curr = get<1>(q.top()); q.pop();
			for (int next : g[curr]) {
				if (chmax(dist[next], min(dist[curr], w[next]))) {
					q.emplace(dist[next], next);
				}
			}
		}
		rep (j, n) {
			if (dist[j] >= w[j]) {
				(ans += count(w[i], w[j])) %= mod;
			}
		}
	}
	cout << ans << endl;

	return 0;
}