#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

void dfs(int u, int x, vector<int>& a, vector<vector<int> >& G, vector<bool>& vis) {
	vis[u] = true;
	for (int i = 0; i < G[u].size(); i++) {
		int v = G[u][i];
		if (!vis[v] && a[v] >= x)
			dfs(v, x, a, G, vis);
	}
}

int main() {
	vector<int> fact(1001);
	fact[0] = 1;
	for (int i = 1; i <= 1000; i++)
		fact[i] = (ll)fact[i - 1] * i % MOD;
	vector<vector<int> > dp(1001, vector<int>(1001));
	dp[0][0] = 1;
	for (int i = 1; i <= 1000; i++)
		for (int j = 0; j < i; j++) {
			dp[i][j] = (dp[i][j] + (ll)j * dp[i - 1][j]) % MOD;
			dp[i][j + 1] = (dp[i][j + 1] + dp[i - 1][j]) % MOD;
		}
	int N, M; cin >> N >> M;
	vector<int> a(N);
	for (int u = 0; u < N; u++)
		cin >> a[u];
	vector<i_i> au(N);
	for (int u = 0; u < N; u++)
		au[u] = i_i(a[u], u);
	sort(au.begin(), au.end());
	vector<vector<int> > G(N);
	while (M--) {
		int u, v; cin >> u >> v;
		u--; v--;
		G[v].push_back(u);
	}
	int sum = 0;
	for (int u = 0; u < N; u++) {
		vector<bool> vis(N);
		dfs(u, a[u], a, G, vis);
		for (int v = 0; v < N; v++)
			if (vis[v])
				sum = (sum + (ll)fact[a[u]] * dp[a[v]][a[u]]) % MOD;
	}
	cout << sum << endl;
}