n, m = map(int, input().split())
h = list(map(int, input().split()))
adj = [[] for _ in range(n)]
for _ in range(m):
    x, y = map(int, input().split())
    adj[x-1].append(y-1); adj[y-1].append(x-1)
dp10 = [0]+[-1]*(n-1); dp11 = [-1]*n
dp20 = [-1]*(n-1)+[0]; dp21 = [-1]*n
for i in range(n):
    for j in adj[i]:
        if j < i: continue
        if h[j]-h[i] < 0: dp10[j] = max(dp10[j], dp10[i], dp11[i])
        elif dp10[i] > -1: dp11[j] = max(dp11[j], dp10[i]+h[j]-h[i])
for i in range(n-1, -1, -1):
    for j in adj[i]:
        if j > i: continue
        if h[j]-h[i] < 0: dp20[j] = max(dp20[j], dp20[i], dp21[i])
        elif dp20[i] > -1: dp21[j] = max(dp21[j], dp20[i]+h[j]-h[i])
print(max(dp10[-1], dp11[-1])); print(max(dp20[0], dp21[0]))