#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    int N,M;
    cin>>N>>M;
    vector<vector<int>> G(N);
    for(int i=0;i<M;i++){
        int a,b;
        cin>>a>>b;
        a--;
        b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    vector<int> dist(N,-1);
    for(int i=0;i<N;i++)if(dist[i] == -1){
        dist[i] = 0;
        queue<int> q;
        q.push(i);
        while(!q.empty()){
            int pos = q.front();
            q.pop();
            for(int x:G[pos]){
                if(dist[x] == -1 || dist[x]%2 != dist[pos]%2){
                    if(dist[x] == -1) q.push(x);
                    dist[x] = 1-dist[pos]%2;
                }
                else{
                    cout<<"No"<<endl;
                    return 0;
                }
            }
        }
    }
    cout<<"Yes"<<endl;
}