#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector e(n, vector<bool>(n));
	rep(i, m) {
		int u, v; cin >> u >> v;
		e[u][v] = e[v][u] = true;
	}
	int x = 0;
	rep(i, 3) {
		int p; cin >> p;
		x += 1 << p;
	}
	vector<int>v(n);
	rep(i, n)v[i] = i;
	do {
		int bit = 0;
		rep(i, n) {
			bit += 1 << v[i];
			if (0 != i) {
				if (!e[v[i - 1]][v[i]])break;
			}
			if (i >= 2 && e[v[0]][v[i]] && x != bit) {
				cout << "Yes" << endl;
				return 0;
			}
		}
	} while (next_permutation(all(v)));
	cout << "No" << endl;
	return 0;
}