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

    Sc=[[] for _ in range(N+1)]
    Sz=[[] for _ in range(N+1)]

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

    inf=float("inf")

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

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

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

    for a in range(N,0,-1):
        for b in Sz[a]:
            if a>b:
                if H[a]<H[b]:
                    DP_z[b][1]=max(DP_z[b][1], DP_z[a][0]+(H[b]-H[a]))
                else:
                    DP_z[b][0]=max(DP_z[b][0], max(DP_z[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()