#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define var auto
#define mod 1000000007
#define inf 2147483647
#define nil -1
#define mp make_pair
typedef long long ll;
using namespace std;

template <typename T>
inline void output(T a, int p) {
    if(p){
        cout << fixed << setprecision(p)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}
// end of template

int main() {
    cin.tie(0);
    // source code
    // calc strling number
    vector<vector<ll>> S(1001, vector<ll>(1001, 0));
    
    repd(i, 1, 1001) S[i][1] = 1;
    repd(i, 2, 1001) repd(j, 2, i + 1){
        S[i][j] = j * (S[i - 1][j] + S[i - 1][j - 1]);
        S[i][j] %= mod;
    }
    
    
    int N, M;
    cin >> N >> M;
    
    vector<vector<int>> E(N, vector<int>(N, 0));
    vector<int> W(N);
    rep(i, N) cin >> W[i], E[i][i] = W[i];
    vector<pair<int, int>> A(M);
    rep(i, M) cin >> A[i].first >> A[i].second, E[A[i].first - 1][A[i].second - 1] = W[A[i].second - 1];
    
    rep(k, N) rep(i, N) rep(j, N){
        E[i][j] = max(E[i][j], min(E[i][k], E[k][j]));
    }
    
    ll ret = 0;
    rep(i, N) rep(j, N){
        if (E[i][j] >= W[j]) {
            ret += S[W[i]][W[j]];
            ret %= mod;
        }
    }
    
    output(ret, 0);
    
    return 0;
}