#include <bits/stdc++.h>

using namespace std;

#define int long long
#define lep(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,b,a) for(int i = (b); i >= (a); i--)
#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
const int inf = 1e18;

template<int MAXN = 100000, int MAXM = 100000>
struct edge_list {
    int size, begin[MAXN], dest[MAXM], next[MAXM];
    void clear (int n) { size = 0; fill(begin, begin + n, -1); }
    edge_list (int n = MAXN) { clear(n); }
    void add_edge(int u, int v) {
        dest[size] = v; next[size] = begin[u]; begin[u] = size++;
    }
};

template<int MAXN = 100000, int MAXM = 100000>
struct tarjan {
    int comp[MAXN], size;
    int dfn[MAXN], ind, low[MAXN], ins[MAXN], stk[MAXN], stks;
    void dfs(const edge_list <MAXN, MAXM> &e, int i) {
        dfn[i] = low[i] = ind++;
        ins[i] = 1; stk[stks++] = i;
        for (int x = e.begin[i]; ~x; x = e.next[x]) {
            int j = e.dest[x];
            if (!~dfn[j]) {
                dfs(e, j);
                if (low[i] > low[j]) low[i] = low[j];
            } else if (ins[j] && low[i] > dfn[j]) {
                low[i] = dfn[j];
            }
        }
        if (dfn[i] == low[i]) {
            for (int j = -1; j != i; j = stk[--stks], ins[j] = 0, comp[j] = size);
            ++size;
        }
    }
    void solve(const edge_list <MAXN, MAXM> &e, int n) {
        size = ind = stks = 0;
        fill(dfn, dfn + n, -1);
        for (int i = 0; i < n; ++i) {
            if (!~dfn[i]) dfs(e, i);
        }
    }
};

void submit(int ans) {
    cout << ans << "\n";
}

int n, m, u, v, ty;

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    edge_list ee;
    vector<pair<int, int>> tp2;
    for (int i = 0; i < m; ++i) {
        cin >> u >> v >> ty;
        u--, v--;
        if (ty == 1) { 
            tp2.push_back({u, v});
        }
        else { 
            ee.add_edge(u, v);
        }
    }
    tarjan tt;
    tt.solve(ee, n);

    vector<int> adj[tt.size];
    vector<int> outdeg(n);
    for (auto pp : tp2) {
        outdeg[tt.comp[pp.f]]++;
        adj[tt.comp[pp.f]].push_back(tt.comp[pp.s]);
    }
    queue<int> q;
    q.push(tt.comp[0]);
    vector<bool> vis(n); vis[tt.comp[0]] = 1;
    while (!q.empty()) {
        int tp = q.front(); q.pop();
        for (int node : adj[tp]) {
            if (outdeg[node] >= 1) {
                cout << "No\n";
                return 0;
            }
        }
    }
    cout << "Yes\n";

    // for (auto pp : tp2) {
    //     ee.add_edge(pp.f, pp.s);
    // }
    // queue<int> q;
    // q.push(0);
    // vector<int> vis(n); vis[0] = 1;
    // while (!q.empty()) {
    //     int tp = q.front(); q.pop();
    //     for (int x = ee.begin[tp]; ~x; x = ee.next[x]) {
    //         int node = ee.dest[x];
    //         if (!vis[node]) {
    //             vis[node] = 1;
    //             cout << tp << " " << node << endl;
    //             if (mm[{tp, node}] && tt.comp[tp] != tt.comp[node] && outdeg[node] >= 1) {
    //                 cout << "Yes\n";
    //                 return 0;
    //             }
    //         }
    //     }
    // }
    // cout << "No\n";
}