#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull long long
#define PII  pair<int ,int>
const int INF = 0x3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int fp(int a, int x, int mod) {
    int ans = 1;
    while (x) {
        if (x & 1)ans *= a;
        ans %= mod;
        a *= a;
        a %= mod;
        x >>= 1;
    }
    return ans;
}



//const int N = 1e6;
struct edge {
    int u, v;
};
struct node {
    int w;
    int id;
    bool operator<(const node& a)const {
        if (w != a.w)
            return w > a.w;
        else return id > a.id;
    }
};
int degree[N];
node a[N];
vector<int>e[N];
int top = 0;
int cnt = 0;
bool vis[N];

int dfs(int u) {
    int ans = a[u].w;
    int res = INF;
    for (int i = 0; i < e[u].size(); i++) {
        int v = e[u][i];
        if (vis[v])continue;
        vis[v] = 1;
        res = min(res, dfs(v));
        vis[v] = 0;
    }
    if (res == INF)res = 0;
    ans = max(ans, res);
    return ans;
}

void solve() {
    int n, m;
    cin >> n >> m;
    int k = n;
    int cnt = n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].w;
        
    }
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        /* e[u].push_back({ u,v });
         e[v].push_back({ v,u });*/
        e[u].push_back(v);
        e[v].push_back(u);
        degree[v]++;
        degree[u]++;
    }
    int st = 1;
    int ans = a[1].w;
    for (int i = 1; i <= n; i++) {
        if (degree[i] >= 2&&ans<a[i].w) {
            st = i;
            ans = a[i].w;
        }
    }
    vis[st] = 1;
    int res = dfs(st);
    cout <<res<< endl;
}

signed main() {
   ios::sync_with_stdio(0);
   cin.tie(0), cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}
/*
 7 7
  1 1 2 3 1 2 1
  1 2
  2 3
  1 3
  2 4
  2 5
  5 6
  5 7
*/