#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
	int n,m;
	cin>>n>>m;
	vector<int> i(m),j(m);
	vector<set<int>> g(n);
	for(int a=0;a<m;a++){
		cin>>i[a]>>j[a];
		g[i[a]].insert(j[a]);
		g[j[a]].insert(i[a]);
	}
	int v[3];
	cin>>v[0]>>v[1]>>v[2];
	if(g[v[0]].find(v[1])!=g[v[0]].end() and g[v[1]].find(v[2])!=g[v[1]].end() and g[v[2]].find(v[0])!=g[v[2]].end()){
		cout<<"No";
	}else{
		cout<<"Yes";
	}
	cout<<endl;
}
signed main(){
	int t=1;
//	cin>>t;
	for(int a=0;a<t;a++){
		solve();
	}
}