#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 dp[1010][1010];
int w[222], dist[222][222];

int main() {
    dp[0][0] = 1;
    rep (i, 1, 1010) rep (j, 1, 1010) {
        dp[i][j] = j * (dp[i - 1][j - 1] + dp[i - 1][j]) % mod;
    }

    int n, m;
    cin >> n >> m;
    rep (i, n) cin >> w[i], dist[i][i] = w[i];
    rep (i, m) {
        int u, v;
        cin >> u >> v; u--; v--;
        dist[u][v] = w[v];
    }

    rep (k, n) rep (i, n) rep (j, n) {
        chmax(dist[i][j], min(dist[i][k], dist[k][j]));
    }

    ll ans = 0;
    rep (i, n) rep (j, n) if (dist[i][j] >= w[j]) {
        (ans += dp[w[i]][w[j]]) %= mod;
    }
    cout << ans << endl;

    return 0;
}