#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;

int main(){
    int n, m; cin >> n >> m;
    vector<int> h(n);
    for(auto &it: h) cin >> it;
    vector<vector<int>> G(n);
    for(int i = 0; i < m; i++){
        int x, y; cin >> x >> y;
        x--; y--;
        G[x].emplace_back(y);
        G[y].emplace_back(x);
    }

    vector<vector<ll>> dp1(2, vector<ll>(n, -(1LL << 60)));
    dp1[0][0] = 0;
    for(int i = 0; i < n; i++){
        for(auto &nex: G[i]){
            if(nex < i) continue;
            if(h[i] < h[nex]) dp1[1][nex] = max(dp1[1][nex], dp1[0][i]+h[nex]-h[i]);
            else dp1[0][nex] = max(dp1[0][nex], max(dp1[0][i], dp1[1][i]));
        }
    }
    cout << (max(dp1[0][n-1], dp1[1][n-1]) >= 0 ? max(dp1[0][n-1], dp1[1][n-1]) : -1) << endl;
    vector<vector<ll>> dp2(2, vector<ll>(n, -(1LL << 60)));
    dp2[0][n-1] = 0;
    for(int i = n-1; i >= 0; i--){
        for(auto &nex: G[i]){
            if(nex > i) continue;
            if(h[i] < h[nex]) dp2[1][nex] = max(dp2[1][nex], dp2[0][i]+h[nex]-h[i]);
            else dp2[0][nex] = max(dp2[0][nex], max(dp2[0][i], dp2[1][i]));
        }
    }
    cout << (max(dp2[0][0], dp2[1][0]) >= 0 ? max(dp2[0][0], dp2[1][0]) : -1) << endl;
    return 0;
}