#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 a, b;
    cin >> a >> b;
    a--;
    b--;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  vector<ll> color(n, -1);
  auto dfs = [&](auto self, ll u, ll p) -> bool {
    for (const auto v : g[u]) {
      if (v == p)
        continue;
      if (color[v] >= 0) {
        if (color[u] == color[v]) {
          return false;
        }
      } else {
        color[v] = 1 - color[u];
        if (!self(self, v, u)) {
          return false;
        }
      }
    }
    return true;
  };
  rep(i, n) {
    if (color[i] >= 0)
      continue;
    color[i] = 0;
    if (!dfs(dfs, i, -1)) {
      cout << "No" << '\n';
      return;
    }
  }
  cout << "Yes" << '\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;
}