#include <bits/stdc++.h>
using namespace std;
#define max_len 100010
struct node
{
    int val;
    list<int> linked;
    multiset<int> val_near;
} node_arr[max_len];

// val, ind
pair<int, int> val_node[max_len];

void link(int u, int v)
{
    node_arr[u].linked.push_back(v);
    node_arr[v].linked.push_back(u);
    node_arr[u].val_near.insert(node_arr[v].val);
    node_arr[v].val_near.insert(node_arr[u].val);
}

void sol()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> node_arr[i].val;
        val_node[i - 1] = make_pair(node_arr[i].val, i);
    }
    for (int i = 0; i < m; i++)
    {
        int u, v;
        cin >> u >> v;
        link(u, v);
    }
    if(n == 1)
    {
        cout << node_arr[1].val << "\n";
        return;
    }
    sort(val_node, val_node + n, greater());
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        auto [val, ind] = val_node[i];
        if(node_arr[ind].linked.size() == 1)
        {
            int ni = *node_arr[ind].linked.begin();
            auto iter = node_arr[ind].val_near.end()--;
            int mx_near = *iter;
            iter--;
            int mx2_near = *iter;
            int at = node_arr[ni].val;
            at = max(at, min(mx_near, mx2_near));
            ans = max(at, ans);
        }
        else
        {
            ans = max(ans, node_arr[ind].val);
            break;
        }
    }
    cout << ans << endl;
    
}
int main()
{
    sol();
}