#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <map>
#include <cmath>
#include <bitset>
#include <string>
#include <queue>
using namespace std;

int main(){
    int n,m;
    cin >> n >> m;
    vector<long long> h(n);
    for(int i=0;i<n;i++) cin >> h[i];
    vector<vector<int>> list(n);

    for(int i=0;i<m;i++){
        int x,y;cin >> x >> y;
        x--;y--;
        list[x].push_back(y);
        list[y].push_back(x);
    }

    vector<long long> dp(n,-1);
    vector<bool> state(n,false); // その階段にくるときに上がったか
    dp[0]=0;
    for(int i =0;i<n;i++){
        if(dp[i]!=-1){
            for(auto x:list[i]){
                if(x<i) continue;
                if(h[i]<h[x] && state[i] == false && dp[x] < dp[i]+(h[x]-h[i])) {
                    dp[x] = dp[i]+(h[x]-h[i]);
                    state[x] = true;
                }else if(h[x]<h[i] && dp[x]<dp[i]){
                    dp[x] = dp[i];
                    state[x] = false;
                }
            }
        }
    }
    cout << dp[n-1] << endl;

    dp.clear();
    dp.resize(n,-1);
    state.clear();
    state.resize(n,false);

    dp[n-1]=0;
    for(int i =n-1;0<=i;i--){
        if(dp[i]!=-1){
            for(auto x:list[i]){
                if(i<x) continue;
                if(h[i]<h[x] && state[i] == false && dp[x] < dp[i]+(h[x]-h[i])) {
                    dp[x] = dp[i]+(h[x]-h[i]);
                    state[x] = true;
                }else if(h[x]<h[i] && dp[x]<dp[i]){
                    dp[x] = dp[i];
                    state[x] = false;
                }
            }
        }
    }
    cout << dp[0] << endl;

}