#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const ll MOD = 1000000007;

int main() {
  int N, M;
  cin >> N >> M;
  vector<ll> H(N + 1);

  for (int i = 1; i <= N; ++i) {
    cin >> H[i];
  }

  vector<int> E[N + 1];
  for (int i = 0; i < M; ++i) {
    int x, y;
    cin >> x >> y;

    E[x].push_back(y);
    E[y].push_back(x);
  }

  ll dp[N + 1][2];
  memset(dp, -1, sizeof(dp));
  dp[1][0] = 0;

  for (int i = 1; i < N; ++i) {
    for (int k = 0; k < 2; ++k) {
      if (dp[i][k] == -1) continue;

      for (int j : E[i]) {
        if (j < i) continue;
        if (k == 1 && H[i] < H[j]) continue;

        if (H[i] < H[j]) {
          dp[j][1] = max(dp[j][1], dp[i][k] + abs(H[j] - H[i]));
        } else {
          dp[j][0] = max(dp[j][0], dp[i][k]);
        }
      }
    }
  }

  cout << max(dp[N][0], dp[N][1]) << endl;

  memset(dp, -1, sizeof(dp));
  dp[N][0] = 0;

  for (int i = N; i > 1; --i) {
    for (int k = 0; k < 2; ++k) {
      if (dp[i][k] == -1) continue;

      for (int j : E[i]) {
        if (i < j) continue;
        if (k == 1 && H[j] > H[i]) continue;

        if (H[i] < H[j]) {
          dp[j][1] = max(dp[j][1], dp[i][k] + abs(H[j] - H[i]));
        } else {
          dp[j][0] = max(dp[j][0], dp[i][k]);
        }
      }
    }
  }

  cout << max(dp[1][0], dp[1][1]) << endl;

  return 0;
}