#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

ll solve(const vector<int>& h, const vector<vector<int>>& stairs) {
  const int n = h.size();
  vector dp(n, vector(2, -LINF));
  dp[0][false] = 0;
  REP(i, n) for (const int j : stairs[i]) {
    if (h[i] < h[j]) {
      chmax(dp[j][true], dp[i][false] + h[j] - h[i]);
    } else {
      chmax(dp[j][false], max(dp[i][false], dp[i][true]));
    }
  }
  return max(*max_element(ALL(dp[n - 1])), -1LL);
}

int main() {
  int n, m; cin >> n >> m;
  vector<int> h(n); REP(i, n) cin >> h[i];
  vector<vector<int>> stairs(n);
  while (m--) {
    int x, y; cin >> x >> y; --x; --y;
    if (x > y) swap(x, y);
    stairs[x].emplace_back(y);
  }
  cout << solve(h, stairs) << '\n';
  reverse(ALL(h));
  vector<vector<int>> nstairs(n);
  REP(i, n) for (const int j : stairs[i]) {
    nstairs[n - 1 - j].emplace_back(n - 1 - i);
  }
  cout << solve(h, nstairs) << '\n';
  return 0;
}