def solve():
    N,M=map(int,input().split())
    H=[-1]+list(map(int,input().split()))

    S=[[] for _ in range(N+1)]
    T=[[] for _ in range(N+1)]

    for j in range(M):
        x,y=map(int,input().split())
        S[y].append(x)
        T[x].append(y)

    inf=float("inf")

    # チェリーちゃん
    DP_c=[[-inf,-inf] for _ in range(N+1)]
    DP_c[1][0]=0

    for b in range(1,N+1):
        for a in S[b]:
            if H[a]>H[b]:
                DP_c[b][0]=max(DP_c[b][0], max(DP_c[a]))
            else:
                DP_c[b][1]=max(DP_c[b][1], DP_c[a][0]+(H[b]-H[a]))

    # ゼルコバ君
    DP_z=[[-inf,-inf] for _ in range(N+1)]
    DP_z[N][0]=0

    for b in range(N,0,-1):
        for a in T[b]:
            if H[a]>H[b]:
                DP_z[b][0]=max(DP_z[b][0], max(DP_z[a]))
            else:
                DP_z[b][1]=max(DP_z[b][1], DP_z[a][0]+(H[b]-H[a]))


    ans_c=max(DP_c[N]) if max(DP_c[N])>-inf else -1
    ans_z=max(DP_z[1]) if max(DP_z[1])>-inf else -1

    print(ans_c, ans_z, sep="\n")

#==================================================
solve()