#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
struct Edge {
	int to;
	long long cost;
	Edge(int _to, long long _cost) :to(_to), cost(_cost) {}
};
long long dikstra(int n, int st, int ed, const vector<vector<Edge>>&g) {
	vector<vector<long long>> dp(n, vector<long long>(2, -LINF));
	priority_queue<pair<long long, pair<int, int>>> q;
	q.push({ 0, {st,1} });
	dp[st][1] = 0;
	while (!q.empty()) {
		auto tmp = q.top();
		q.pop();
		long long cost = tmp.first;
		int pos = tmp.second.first;
		int type = tmp.second.second;
		if (cost < dp[pos][type]) continue;
		for (Edge e : g[pos]) {
			long long ncost = cost + e.cost;
			int npos = e.to;
			if (0 == type) {
				if (e.cost > 0) {
					// nop
				}
				else {
					if (chmax(dp[npos][1], ncost)) q.push({ ncost, {npos,1 } });
				}
			}
			else {
				if (e.cost > 0) {
					if (chmax(dp[npos][0], ncost)) q.push({ ncost, {npos,0 } });
				}
				else {
					if (chmax(dp[npos][1], ncost)) q.push({ ncost, {npos,1 } });
				}
			}
		}
	}
	long long ret = max(dp[ed][0], dp[ed][1]);
	if (-LINF == ret) ret = -1;
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>h(n);
	vector<vector<Edge>>g0(n), g1(n);
	rep(i, n)cin >> h[i];
	rep(i, m) {
		int x, y; cin >> x >> y; x--, y--;
		if (x > y)swap(x, y);
		g0[x].emplace_back(y, max(0, h[y] - h[x]));
		g1[y].emplace_back(x, max(0, h[x] - h[y]));
	}
	cout << dikstra(n, 0, n - 1, g0) << endl;
	cout << dikstra(n, n - 1, 0, g1) << endl;
	return 0;
}