n, m = read_line.split.map(&.to_i)
h = read_line.split.map(&.to_i64)
es = Array.new(m) { read_line.split.map { |v| v.to_i - 1 } }

puts solve(h, es)
h.reverse!
es.map! { |e| [n - 1 - e[1], n - 1 - e[0]] }
puts solve(h, es)

def solve(h, es)
  n = h.size
  g = Array.new(n) { [] of Int32 }
  es.each do |e|
    g[e[0]] << e[1]
  end
  dp = Array.new(2) { Array.new(n, -1i64) }
  dp[0][0] = 0
  n.times do |i|
    h0 = h[i]
    if dp[0][i] != -1
      g[i].each do |adj|
        h1 = h[adj]
        if h0 < h1
          dp[1][adj] = {dp[1][adj], dp[0][i] + h1 - h0}.max
        else
          dp[0][adj] = {dp[0][adj], dp[0][i]}.max
        end
      end
    end
    if dp[1][i] != -1
      g[i].each do |adj|
        h1 = h[adj]
        if h0 < h1
          #
        else
          dp[0][adj] = {dp[0][adj], dp[1][i]}.max
        end
      end
    end
  end
  return {dp[0][-1], dp[1][-1]}.max
end