#if defined(LOCAL)
#include<stdc++.h>
#else
#include<bits/stdc++.h>
#endif
#include<random>
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
//#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define MINF (lint)(2e18)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define flc(x) __builtin_popcountll(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
//#define vec vector<lint>
#define nep(x) next_permutation(all(x))
typedef long long lint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=3e5+5;
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
//vector<int> bucket[MAX_N/1000];
//constexpr int MOD=1000000007;
constexpr int MOD=998244353;
/*#include<atcoder/all>
using namespace atcoder;
typedef __int128_t llint;*/

int main(void){
    lint N,M;
    cin >> N >> M;
    lint H[N];
    rep(i,N) cin >> H[i];
    vector<int> edge[N];
    rep(i,M){
        int u,v;
        cin >> u >> v;
        u--,v--;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    lint ldp[N][2],rdp[N][2];
    rep(i,N) rep(j,2) ldp[i][j]=-1,rdp[i][j]=-1;
    ldp[0][0]=0,rdp[N-1][0]=0;
    rep(i,N) rep(j,2){
        if(ldp[i][j]==-1) continue;
        for(auto e:edge[i]){
            if(e<i) continue;
            if(H[e]>H[i]){
                if(j==0) chmax(ldp[e][1],ldp[i][j]+H[e]-H[i]);
            }
            else{
                chmax(ldp[e][0],ldp[i][j]);
            }
        }
    }
    reprev(i,N) rep(j,2){
        if(rdp[i][j]==-1) continue;
        for(auto e:edge[i]){
            if(e>i) continue;
            if(H[e]>H[i]){
                if(j==0) chmax(rdp[e][1],rdp[i][j]+H[e]-H[i]);
            }
            else{
                chmax(rdp[e][0],rdp[i][j]);
            }
        }
    }
    cout << max(ldp[N-1][0],ldp[N-1][1]) << endl;
    cout << max(rdp[0][0],rdp[0][1]) << endl;
}