#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
	int n,m;
	cin>>n>>m;
	vector<vector<int>> graph(n);
	for(int i=0;i<m;i++){
		int a,b;
		cin>>a>>b;
		a--;b--;
		graph[a].push_back(b);
		graph[b].push_back(a);
	}
	vector<int> sign(n,-1);
	auto dfs=[&](auto dfs,int p)->bool{
		for(int x:graph[p]){
			if(sign[x]!=-1){
				if(sign[x]==sign[p])return false;
				else continue;
			}
			sign[x]=1-sign[p];
			if(!dfs(dfs,x))return false;
		}	
		return true;
	};
	for(int i=0;i<n;i++){
		if(sign[i]!=-1)continue;
		else sign[i]=0;
		if(!dfs(dfs,i))cout<<"No"<<endl,exit(0);
	}
	cout<<"Yes"<<endl,exit(0);


}