import sys
input = sys.stdin.readline

from heapq import heappop,heappush

N,M=list(map(int,input().split()))
W=list(map(int,input().split()))

mod=10**9+7

FACT=[1]
for i in range(1,2*10**5+1):
    FACT.append(FACT[-1]*i%mod)

FACT_INV=[pow(FACT[-1],mod-2,mod)]
for i in range(2*10**5,0,-1):
    FACT_INV.append(FACT_INV[-1]*i%mod)

FACT_INV.reverse()

def Combi(a,b):
    if 0<=b<=a:
        return FACT[a]*FACT_INV[b]%mod*FACT_INV[a-b]%mod
    else:
        return 0

E=[[] for i in range(N)]

for i in range(M):
    x,y=list(map(int,input().split()))
    x-=1
    y-=1
    E[x].append(y)

ANS=0

for i in range(N):
    DP=[0]*N
    DP[i]=W[i]

    Q=[]
    Q.append((-W[i],i))

    while Q:
        weight,ind=heappop(Q)

        weight=-weight

        for to in E[ind]:
            necw=min(weight,W[to])

            if DP[to]<necw:
                DP[to]=necw
                heappush(Q,(-DP[to],to))

    #print(DP)

    for j in range(N):
        if DP[j]==W[j]:
            score=0
            now=W[j]

            for k in range(W[j],0,-1):
                if k%2==W[j]%2:
                    score+=pow(k,W[i],mod)*Combi(W[j],k)
                else:
                    score-=pow(k,W[i],mod)*Combi(W[j],k)

            ANS+=score

print(ANS%mod)