using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var h = NList;
        var map = NMap(m);

        Array.Sort(map, (l, r) => l[0].CompareTo(r[0]));
        var dp = new long[2][];
        for (var i = 0; i < dp.Length; ++i) dp[i] = Enumerable.Repeat(long.MinValue, n).ToArray();
        dp[1][0] = 0;
        foreach (var stair in map)
        {
            if (h[stair[0]] < h[stair[1]])
            {
                dp[0][stair[1]] = Math.Max(dp[0][stair[1]], dp[1][stair[0]] + h[stair[1]] - h[stair[0]]);
            }
            else
            {
                dp[1][stair[1]] = Math.Max(dp[1][stair[1]], Math.Max(dp[0][stair[0]], dp[1][stair[0]]));
            }
        }
        var ch = Math.Max(dp[0][n - 1], dp[1][n - 1]);
        if (ch < 0) ch = -1;

        Array.Sort(map, (l, r) => r[1].CompareTo(l[1]));
        dp = new long[2][];
        for (var i = 0; i < dp.Length; ++i) dp[i] = Enumerable.Repeat(long.MinValue, n).ToArray();
        dp[1][n - 1] = 0;
        foreach (var stair in map)
        {
            if (h[stair[0]] > h[stair[1]])
            {
                dp[0][stair[0]] = Math.Max(dp[0][stair[0]], dp[1][stair[1]] + h[stair[0]] - h[stair[1]]);
            }
            else
            {
                dp[1][stair[0]] = Math.Max(dp[1][stair[0]], Math.Max(dp[0][stair[1]], dp[1][stair[1]]));
            }
        }
        var ze = Math.Max(dp[0][0], dp[1][0]);
        if (ze < 0) ze = -1;
        WriteLine(ch);
        WriteLine(ze);
    }
}