#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 222;
const int MAX = 1011;
const ll MOD = 1e9+7;
int w[MAXN];
int d[MAXN][MAXN];
ll nCr[MAX][MAX];
ll pm[MAX][MAX];

ll pow_mod(ll x, int p) {
    if (x == 0) return 0;
    if (p == 0) return 1;
    if (p == 1) return x;
    if (p%2) return (x*pow_mod(x, p-1))%MOD;
    ll tmp = pow_mod(x, p/2);
    return (tmp*tmp)%MOD;
}

ll calc(int from, int to) {
    ll ret = 0;
    for (int i = 1; i <= to; i++) {
        ll tmp = nCr[to][i] * pm[i][from] % MOD;
        if ((to-i)%2) tmp *= -1;
        ret += tmp;
    }
    ret %= MOD;
    if (ret < 0) ret += MOD;
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    for (int i = 0; i < MAX; i++) {
        nCr[i][0] = 1;
        for (int j = 1; j <= i; j++) {
            nCr[i][j] = nCr[i-1][j-1] + nCr[i-1][j];
            nCr[i][j] %= MOD;
        }
    }
    for (int i = 0; i < MAX; i++) for (int j = 0; j < MAX; j++) {
        pm[i][j] = pow_mod(i, j);
    }
    int N, M;
    cin >> N >> M;
    for (int i = 0; i < N; i++) cin >> w[i];
    for (int i = 0; i < N; i++) d[i][i] = w[i];
    for (int i = 0; i < M; i++) {
        int from, to;
        cin >> from >> to;
        from--; to--;
        d[from][to] = min(w[from], w[to]);
    }
    for (int k = 0; k < N; k++) {
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                d[i][j] = max(d[i][j], min(d[i][k], d[k][j]));
            }
        }
    }
    ll ans = 0;
    for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {
        if (w[j] <= d[i][j]) ans += calc(w[i], w[j]);
    }
    ans %= MOD;
    cout << ans << endl;
    return 0;
}