n,m = map(int,input().split())
H = list(map(int,input().split()))
e = [[] for i in range(n)]
for _ in range(m):
    x,y = map(int,input().split())
    x,y = x-1,y-1
    e[x].append(y)
    e[y].append(x)


dp = [[-1]*2 for i in range(n)]
dp[0] = [0,0]
for i in range(n):
    h = H[i]
    for nex in e[i]:
        if nex < i:
            continue
        nh = H[nex]
        if h < nh and dp[i][0] != -1:
            dp[nex][1] = max(dp[nex][1],dp[i][0]+nh-h)
        if h > nh:
            dp[nex][0] = max(dp[nex][0],max(dp[i]))

print(max(dp[-1]))
      
dp = [[-1]*2 for i in range(n)]
dp[-1] = [0,0]
for i in range(n)[::-1]:
    h = H[i]
    for nex in e[i]:
        if nex > i:
            continue
        nh = H[nex]
        if h < nh and dp[i][0] != -1:
            dp[nex][1] = max(dp[nex][1],dp[i][0]+nh-h)
        if h > nh:
            dp[nex][0] = max(dp[nex][0],max(dp[i]))

print(max(dp[0]))