#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int MOD=998244353;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(l);i<(int)(r);i++)
#define all(v) v.begin(),v.end()

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N,M;
  cin>>N>>M;
  vector E(N,vector(N,0));
  rep(i,M){
    int A,B;
    cin>>A>>B;
    E[A][B]=1;
    E[B][A]=1;
  }
  set<int>ng;
  rep(i,3){
    int t;cin>>t;
    ng.insert(t);
  }
  vector P(N,0);
  iota(all(P),0);
  do{
    set<int> t;
    bool ok=1;
    t.insert(P[0]);
    rep(i,min(3,N-1)){
      t.insert(P[i+1]);
      if(!E[P[i]][P[i+1]])ok=0;
    }
    if(ok&&t!=ng){
      cout<<"Yes\n";
      return 0;
    }
    ok=1;
    t.clear();
    t.insert(P[0]);
    rep(i,min(3,N-1)){
      t.insert(P[i+1]);
      if(!E[P[i]][P[i+1]])ok=0;
    }
    if(ok&&t!=ng){
      cout<<"Yes\n";
      return 0;
    }
  }while(next_permutation(all(P)));
  cout<<"No\n";
}