#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
int main(){
  int N, M;
  cin >> N >> M;
  vector<int> H(N);
  for (int i = 0; i < N; i++){
    cin >> H[i];
  }
  vector<vector<int>> E(N);
  vector<vector<int>> E2(N);
  for (int i = 0; i < M; i++){
    int X, Y;
    cin >> X >> Y;
    X--;
    Y--;
    E[X].push_back(Y);
    E2[Y].push_back(X);
  }
  vector<vector<long long>> dp1(2, vector<long long>(N, -INF));
  dp1[0][0] = 0;
  dp1[1][0] = 0;
  for (int i = 1; i < N; i++){
    for (int j : E2[i]){
      if (H[i] > H[j]){
        if (dp1[0][j] != -INF){
          dp1[1][i] = max(dp1[1][i], dp1[0][j] + (H[i] - H[j]));
        }
      } else {
        if (dp1[0][j] != INF || dp1[1][j] != INF){
          dp1[0][i] = max(dp1[0][i], dp1[0][j]);
          dp1[0][i] = max(dp1[0][i], dp1[1][j]);
        }
      }
    }
  }
  vector<vector<long long>> dp2(2, vector<long long>(N, -INF));
  dp2[0][N - 1] = 0;
  dp2[1][N - 1] = 0;
  for (int i = N - 2; i >= 0; i--){
    for (int j : E[i]){
      if (H[i] > H[j]){
        if (dp2[0][j] != -INF){
          dp2[1][i] = max(dp2[1][i], dp2[0][j] + (H[i] - H[j]));
        }
      } else {
        if (dp2[0][j] != INF || dp2[1][j] != INF){
          dp2[0][i] = max(dp2[0][i], dp2[0][j]);
          dp2[0][i] = max(dp2[0][i], dp2[1][j]);
        }
      }
    }
  }
  if (dp1[0][N - 1] == -INF && dp1[1][N - 1] == -INF){
    cout << -1 << endl;
  } else {
    cout << max(dp1[0][N - 1], dp1[1][N - 1]) << endl;
  }
  if (dp2[0][0] == -INF && dp2[1][0] == -INF){
    cout << -1 << endl;
  } else {
    cout << max(dp2[0][0], dp2[1][0]) << endl;
  }
}