#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ll long long
#define double long double
#define endl '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define x first
#define y second
#define debug(_x) cout << #_x << '=' << _x << endl
typedef pair<int, int> PII;
using i64 = long long;
const int mod = 1e9 + 7;
const int N = 2e5 + 10;

int v[N], d[N];

void solve()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i];
    }
    while (m--)
    {
        int u, v;
        cin >> u >> v;
        d[u]++;
        d[v]++;
    }
    int ans = 0;
    if (n == 1)
    {
        cout << v[1] << endl;
        return;
    }
    for (int i = 1; i <= n; i++)
    {
        if (d[1] != 1)
        {
            ans = max(ans, v[i]);
        }
    }
    sort(v + 1, v + 1 + n, greater());
    ans = max(ans, v[1]);
    cout << ans << endl;
}

int main()
{
    /*ios::sync_with_stdio(false);
    cin.tie(nullptr);*/
    int _ = 1;
    // cin >> _;

    while (_--)
        solve();

    return 0;
}