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

    dp.clear();
    dp.resize(2);
    dp[0].resize(n,-1);
    dp[1].resize(n,-1);
    state.clear();
    state.resize(n,false);

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


}