#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }


template<int MOD>
struct ModInt {
	static const int Mod = MOD;
	unsigned x;
	ModInt() : x(0) {}
	ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	int get() const { return (int)x; }

	ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }

	ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
	ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
	ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
};
typedef ModInt<1000000007> mint;

const int MaxN = 1000;
mint dp[MaxN + 1][MaxN + 1];

void precompute() {
	dp[0][0] = 1;
	for(int n = 1; n <= MaxN; ++ n)
		for(int k = 1; k <= n; ++ k)
			dp[n][k] = dp[n - 1][k] * k + dp[n - 1][k - 1] * k;
}

int main() {
	precompute();
	int N; int M;
	while(~scanf("%d%d", &N, &M)) {
		vector<int> w(N);
		for(int i = 0; i < N; ++ i)
			scanf("%d", &w[i]);
		vector<vi> ig(N);
		rep(i, M) {
			int a; int b;
			scanf("%d%d", &a, &b), -- a, -- b;
			ig[b].push_back(a);
		}
		mint ans;
		rep(i, N) {
			vector<bool> vis(N);
			vi stk;
			stk.push_back(i);
			while(!stk.empty()) {
				int j = stk.back(); stk.pop_back();
				if(vis[j]) continue;
				vis[j] = true;

				ans += dp[w[j]][w[i]];

				for(int k : ig[j]) if(w[i] <= w[k])
					stk.push_back(k);
			}
		}
		printf("%d\n", ans.get());
	}
	return 0;
}