//https://ncode.syosetu.com/n4830bu/329/
#include <bits/stdc++.h>
using namespace std;

#include "atcoder/all"
using namespace atcoder;
using Mint = modint1000000007;

vector c(2000, vector(2000, Mint{0}));
vector seen(2000, vector(2000, false));

Mint C(int n, int k) {
    if (k < 0 || n < k)
        return 0;
    if (n == 0 || n == k)
        return 1;
    if (seen[n][k])
        return c[n][k];
    seen[n][k] = true;
    return c[n][k] = C(n - 1, k - 1) + C(n - 1, k);
}

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> W(N);
    for (auto&& w : W) {
        cin >> w;
    }
    vector G(N, vector(N, 0));
    for (int i = 0; i < N; i++) {
        G[i][i] = W[i];
    }
    while (M--) {
        int i, j;
        cin >> i >> j;
        i--;
        j--;
        G[i][j] = min(W[i], W[j]);
    }
    for (int k = 0; k < N; k++) {
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                G[i][j] = max(G[i][j], min(G[i][k], G[k][j]));
            }
        }
    }
    auto maine = [&](int n, int k) {
        Mint book = 0;
        for (int i = 0; i <= k; i++) {
            book += (i % 2 == 0 ? Mint{1} : Mint{-1}) * C(k, i) * Mint{k - i}.pow(n);
        }
        return book;
    };
    Mint ans = 0;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (G[i][j] == W[j]) {
                ans += maine(W[i], W[j]);
            }
        }
    }
    cout << ans.val() << endl;
}