#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,m,u,v,a[N],b[N],id[N];
bool cmp(int x,int y){
	return a[x]>a[y];
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		id[i]=i;
	}
	for(int i=1;i<=m;i++){
		scanf("%d%d",&u,&v);
		b[u]++;
		b[v]++;
	}
	sort(id+1,id+n+1,cmp);
	if(b[id[1]]==1) printf("%d ",a[id[2]]);
	else printf("%d ",a[id[1]]);
	return 0;
}