#include<bits/stdc++.h>
using namespace std;
#define ll long long int

int main()
{
    ll n, m;
    cin >> n >> m;
    ll taka[n], aoki[n];
    for (ll i = 0; i < n; i++) {
        taka[i] = 0;
        aoki[i] = 0;
    }
    for (ll i = 0; i < m; i++) {
        ll a, b;
        cin >> a >> b;
        taka[a - 1]++;
        taka[b - 1]++;
    }
    for (ll i = 0; i < m; i++) {
        ll c, d;
        cin >> c >> d;
        aoki[c - 1]++;
        aoki[d - 1]++;
    }

    sort(taka, taka + n);
    sort(aoki, aoki + n);

    bool poss = true;
    for (ll i = 0; i < n; i++) {
        if (taka[i] != aoki[i])
            poss = false;
    }

    if (poss)
        cout << "Yes";
    else
        cout << "No";

    return 0;
}