#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const ll inf = 1e18;

ll solve(vector<ll> h, vector<int> x, vector<int> y){
    int n = h.size(), m = x.size();
    vector<vector<int>> g(n);
    for(int i = 0; i < m; i++){
        if(x[i] < y[i]) g[x[i]].push_back(y[i]);
        else g[y[i]].push_back(x[i]);
    }
    auto dp = vec2d(n, 2, -inf);
    dp[0][0] = 0;
    dp[0][1] = 0;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 2; j++){
            if(dp[i][j] == -inf) continue;
            for(int to: g[i]){
                if(to < i) continue;
                if(h[i] > h[to]){ // 降りる
                    chmax(dp[to][0], dp[i][j]);
                }else{
                    if(j == 0) chmax(dp[to][1], dp[i][j]+h[to]-h[i]);
                }
            }
        }
        // cout << dp[i][0] << ' ' << dp[i][1] << endl;
    }
    ll mx = max(dp[n-1][0], dp[n-1][1]);
    if(mx == -inf) return -1;
    return mx;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    vector<ll> h(n);
    for(int i = 0; i < n; i++) cin >> h[i];
    vector<int> x(m), y(m);
    for(int i = 0; i < m; i++){
        cin >> x[i] >> y[i]; x[i]--; y[i]--;
    }
    cout << solve(h, x, y) << endl;
    reverse(h.begin(), h.end());
    for(int i = 0; i < m; i++){
        x[i] = n-1-x[i];
        y[i] = n-1-y[i];
    }
    cout << solve(h, x, y) << endl;
}