#include <bits/stdc++.h>
using namespace std;
// #undef _GLIBCXX_DEBUG // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
// #pragma GCC target("movbe") // byte swap
// #pragma GCC target("aes,pclmul,rdrnd") // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define INF ((ll)(1e9+7))
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << (x) << endl;
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;
vvl adj(3e5);
int main() {
// cout << fixed << setprecision(20);
// auto start = std::chrono::steady_clock::now(); // since(start).count()
cin.tie(0)->sync_with_stdio(0);
int n, m, from, to;
cin >> n >> m;
vl h(n);
fo(i, n) cin >> h[i];
fo(i, m){
cin >> from >> to;
adj[--from].pb(--to);
adj[to].pb(from);
}
priority_queue<pl> pq;
vl a(n, -1), b(n, -1);
pq.push({0, 0});
ll pos, height;
while(!pq.empty()){
tie(height, pos) = pq.top();
pq.pop();
height = -height;
if(a[pos] != -1) continue;
// deb2(pos, height);
a[pos] = height;
for(auto &v : adj[pos]){
if(a[v] != -1) continue;
pq.push({-max(h[v], height+1), v});
}
}
pq.push({0, n-1});
while(!pq.empty()){
tie(height, pos) = pq.top();
pq.pop();
height = -height;
if(b[pos] != -1) continue;
b[pos] = height;
for(auto &v : adj[pos]){
if(b[v] != -1) continue;
pq.push({-max(h[v], height+1), v});
}
}
ll ans = 1e18;
fo(i, n){
if(a[i] == b[i]) ans = min(ans, a[i]+b[i]);
for(auto &v : adj[i]){
if(a[i] == b[v]) ans = min(ans, a[i]+b[v]+1);
}
}
cout << ans;
return 0;
}
