#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  ll n, m;
  cin >> n >> m;
  vector g(n, vector<ll>());
  rep(i, m) {
    ll u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  set<ll> vs;
  rep(i, 3) {
    ll v;
    cin >> v;
    vs.insert(v);
  }
  auto dfs = [&](auto self, ll s, ll u, ll p, set<ll> &used) -> bool {
    if (s == u && !used.empty()) {
      return used != vs;
    }
    for (const auto v : g[u]) {
      if (v == p || used.count(v))
        continue;
      used.insert(v);
      bool res = self(self, s, v, u, used);
      used.erase(v);
      if (res)
        return true;
    }
    return false;
  };
  rep(s, n) {
    set<ll> used;
    if (dfs(dfs, s, s, -1, used)) {
      cout << "Yes\n";
      return;
    }
  }
  cout << "No\n";
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}