N, M = map(int, input().split())
H = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(M)]
# dp[i][j]:= 足場iにいてその前の移動が昇り:1,下り:0のときの登った回数の最大値
E = [[] for _ in range(N)]
for x, y in XY:
    E[x - 1].append(y - 1)
dp = [[-10 ** 12, -10 ** 12] for _ in range(N)]
dp[0][0] = 0
dp[0][1] = 0
for x in range(N):
    hx = H[x]
    for y in E[x]:
        hy = H[y]
        if hy > hx:
            dp[y][1] = max(dp[y][1], dp[x][0] + hy - hx)
        else:
            dp[y][0] = max(dp[y][0], dp[x][1], dp[x][0])
ans = []
ans.append(max(dp[N - 1]))
E = [[] for _ in range(N)]
for x, y in XY:
    E[y - 1].append(x - 1)
dp = [[-10 ** 12, -10 ** 12] for _ in range(N)]
dp[N - 1][0] = 0
dp[N - 1][1] = 0
for y in reversed(range(N)):
    hy = H[y]
    for x in E[y]:
        hx = H[x]
        if hx > hy:
            dp[x][1] = max(dp[x][1], dp[y][0] + hx - hy)
        else:
            dp[x][0] = max(dp[x][0], dp[y][1], dp[y][0])
ans.append(max(dp[0]))
for i in range(2):
    if ans[i] < 0:
        print(-1)
    else:
        print(ans[i])