// WA (forget to consider cases where the input graph is disconnected)

#include <iostream>
#include <vector>

bool is_bipartite(const std::vector<std::vector<int>>& g) {
    const int n = g.size();

    enum Color { RED = 0, BLUE, NONE };

    std::vector<Color> color(n, NONE);
    color[0] = RED;
    std::vector<int> st{ 0 };
    while (st.size()) {
        int u = st.back();
        st.pop_back();
        for (int v : g[u]) {
            if (color[v] == NONE) {
                color[v] = Color(color[u] ^ 1);
                st.push_back(v);
            } else if (color[v] == color[u]) {
                return false;
            }
        }
    }
    return true;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n, m;
    std::cin >> n >> m;

    std::vector<std::vector<int>> g(n);
    for (int i = 0; i < m; ++i) {
        int u, v;
        std::cin >> u >> v;
        --u, --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    if (is_bipartite(g)) {
        std::cout << "Yes" << std::endl;
    } else {
        std::cout << "No" << std::endl;
    }
}