#include <bits/stdc++.h>
using namespace std;

void fast_io() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
}

int main() {
	fast_io();
	int n, m;
	cin >> n >> m;
	bool g[n][n] = {};
	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		g[a][b] = g[b][a] = true;
	}
	set<int> v;
	for (int i = 0; i < 3; i++) {
		int a;
		cin >> a;
		v.insert(a);
	}
	int p[n];
	iota(p, p + n, 0);
	do {
		bool ok = true;
		for (int i = 0; i < n; i++) {
			if (!g[p[i]][p[(i + 1) % n]]) {
				ok = false;
				break;
			}
		}
		if (ok) {
			set<int> st;
			for (int i = 0; i < 3; i++) {
				st.insert(p[i]);
			}
			if (st != v) {
				cout << "Yes" << endl;
				return 0;
			}
		}
		if (n == 4) {
			bool ok = true;
			for (int i = 0; i < 3; i++) {
				if (!g[p[i]][p[(i + 1) % 3]]) {
					ok = false;
					break;
				}
			}
			if (ok) {
				set<int> st;
				for (int i = 0; i < 3; i++) {
					st.insert(p[i]);
				}
				if (st != v) {
					cout << "Yes" << endl;
					return 0;
				}
			}
		}
	} while (next_permutation(p, p + n));
	cout << "No" << endl;
}