from collections import deque
n, m = map(int, input().split())
h = list(map(int, input().split()))
e = [[] for i in range(n)]
re = [[] for i in range(n)]
for i in range(m):
  x, y = map(lambda x: int(x)-1, input().split())
  x, y = sorted([x, y])
  e[x].append(y)
  re[y].append(x)
dp = [[-1, -1] for i in range(n)]
dp[0] = [0, -1]
flg = [0] * n
flg[0] = 1
for u in range(n):
  if flg[u] == 0:
    continue
  for v in e[u]:
    if h[v] > h[u]:
      if dp[u][0] == -1:
        continue
      dp[v][1] = max(dp[v][1], dp[u][0]+h[v]-h[u])
    else:
      dp[v][0] = max(dp[v][0], max(dp[u]))
    flg[v] = 1
print(max(dp[-1]))
dp = [[-1, -1] for i in range(n)]
dp[-1] = [0, -1]
flg = [0] * n
flg[-1] = 1
for u in reversed(range(n)):
  if flg[u] == 0:
    continue
  for v in re[u]:
    if h[v] > h[u]:
      if dp[u][0] == -1:
        continue
      dp[v][1] = max(dp[v][1], dp[u][0]+h[v]-h[u])
    else:
      dp[v][0] = max(dp[v][0], max(dp[u]))
    flg[v] = 1
print(max(dp[0]))