from collections import defaultdict
from heapq import heapify, heappop, heappush
import sys
input = sys.stdin.readline

def main():
    n, m = map(int, input().split())
    H = list(map(int, input().split()))
    G = [defaultdict(list), defaultdict(list)]
    for _ in range(m):
        x, y = map(int, input().split())
        x -= 1
        y -= 1
        G[0][x].append((y, max(H[y] - H[x], 0)))
        G[1][y].append((x, max(H[x] - H[y], 0)))

    DP = [[[-1, -1] for _ in range(n)] for _ in range(2)]
    DP[0][0][0] = 0
    DP[1][n - 1][0] = 0
    H = [(0, 0), (0, n - 1 + 2 * n)]
    heapify(H)
    while H:
        cnt, cp = heappop(H)
        cnt *= -1
        if cp >= 2 * n:
            cp -= 2 * n
            idx = 1
        else:
            idx = 0
        if cp >= n:
            cp -= n
            up = 1
        else:
            up = 0
        if cnt < DP[idx][cp][up]:
            continue
        for np, d in G[idx][cp]:
            if d > 0:
                if up == 0:
                    res = cnt + d
                    if res <= DP[idx][np][1]:
                        continue
                    DP[idx][np][1] = res
                    heappush(H, (-res, np + n + idx * 2 * n))
            else:
                if cnt <= DP[idx][np][0]:
                    continue
                DP[idx][np][0] = cnt
                heappush(H, (-cnt, np + idx * 2 * n))
    print(max(DP[0][n - 1]))
    print(max(DP[1][0]))

if __name__ == '__main__':
    main()