#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <random>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)

template<class T>
using vi = vector<T>;

template<class T>
using vii = vector<vi<T>>;

template<class T>
using viii = vector<vii<T>>;

void chmax(ll & x, ll y) { x = max(x, y); }

ll solve(int n, vi<ll> &h, vii<int> &to) {
	const ll inf = 1e18;
	vii<ll> dp(2, vi<ll>(n, -inf));
	dp[0][0] = 0;
	rep(v, n) {
		for (int nv : to[v]) {
			if (h[v] < h[nv]) chmax(dp[1][nv], dp[0][v] + h[nv] - h[v]);
			else {
				chmax(dp[0][nv], dp[1][v]);
				chmax(dp[0][nv], dp[0][v]);
			}
		}
	}
	return max(dp[0][n - 1], dp[1][n - 1]);
}

int main()
{
	int n, m;
	cin >> n >> m;
	
	vi<ll> hc(n), hz(n);
	rep(i, n) cin >> hc[i];
	rep(i, n) hz[i] = hc[n - 1 - i];

	vii<int> toc(n), toz(n);
	rep(i, m) {
		int x, y;
		cin >> x >> y;
		x--, y--;
		toc[x].push_back(y);
		toz[n - 1 - y].push_back(n - 1 - x);
	}
	ll resc = solve(n, hc, toc);
	ll resz = solve(n, hz, toz);
	cout << (resc < 0 ? -1 : resc) << endl;
	cout << (resz < 0 ? -1 : resz) << endl;

	return 0;
}