#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
#define rep(i,n) for(i=0;i<(int)(n);i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

int n,m;

int main(){
    int i,j;
    scanf("%d%d",&n,&m);
    vector<int> a(n);
    vector<vector<int> > adj(n,vector<int>(0));
    rep(i,n)scanf("%d",&a[i]);
    while(m--){
        scanf("%d%d",&i,&j);
        i--;j--;
        adj[i].push_back(j);
        adj[j].push_back(i);
    }
    vector<int> path;
    vector<bool> vis(n,false);
    auto dfs=[&](auto& f,int now)->bool{
        path.push_back(now);
        vis[now]=true;
        if(path.size()==3){
            int data[]={0,1,2};
            sort(data,data+3,[&](int i,int j)->bool{
                return a[path[i]]<a[path[j]];
            });
            vis[now]=false;
            path.pop_back();
            return data[0]==1||data[2]==1;
        }
        int i,j;
        rep(i,adj[now].size()){
            if(vis[adj[now][i]]==false){
                rep(j,path.size())if(a[path[j]]==a[adj[now][i]])break;
                if(j==path.size()&&f(f,adj[now][i]))return true;
            }
        }
        vis[now]=false;
        path.pop_back();
        return false;
    };
    rep(i,n)if(dfs(dfs,i))break;
    printf("%s\n",i==n?"NO":"YES");
    return 0;
}