#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//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; }
#include <vector>
/*
	二部グラフ判定
*/
struct BipartiteGraphChecker {

	BipartiteGraphChecker(int n) :n(n) {
		col.assign(n, -1);
		graph.resize(n);
	}

	void add_edge(int u, int v) {
		graph[u].push_back(v);
		graph[v].push_back(u);
	}
	int n;
	std::vector<std::vector< int >> graph;
	std::vector<int>col;

	bool solve(int  v, int p = -1) {
		if (-1 == p)col[v] = 0;
		bool ret = true;
		for (auto e : graph[v]) {
			if (-1 != col[e]) {
				if (1 != col[e] + col[v])ret = false;
			}
			else {
				col[e] = 1 - col[v];
				ret &= solve(e, v);
			}
		}
		return ret;
	}
	bool solverAll() {
		bool chk = true;
		for (int i = 0; i < n; ++i) {
			if (-1 != col[i])continue;
			auto get = solve(i);
			if (!get)chk = false;
		}
		return chk;
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	BipartiteGraphChecker bgc(n);
	rep(i, m) {
		int a, b; cin >> a >> b;
		a--, b--;
		bgc.add_edge(a, b);
	}
	auto get = bgc.solverAll();
	cout << (get ? "Yes" : "No") << endl;
	return 0;
}