#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n, m;
vector<int> g[N], g2[N];
int dfn[N], low[N], dclk;
int col[N], colnum;
int ins[N];
stack<int> sta;
inline void Tarjan(int x) {
    dfn[x] = low[x] = ++dclk;
    sta.push(x); ins[x] = 1;
    for (auto y : g[x]) 
        if (!dfn[y]) Tarjan(y), low[x] = min(low[x], low[y]);
        else if (ins[y]) low[x] = min(low[x], dfn[y]);
    if (low[x] == dfn[x]) {
        col[x] = ++colnum;
        ins[x] = 0;
        while (sta.top() != x) {
            col[sta.top()] = x;
            ins[sta.top()] = 0;
            sta.pop();
        }
        sta.pop();
    } 
}
int valid[N], vis[N];
inline void Dfs(int x) {
    if (valid[col[x]]) { 
        cout << "Yes" << endl;
        exit(0);
    }
    vis[x] = 1;
    for (auto y : g[x]) if (!vis[y]) Dfs(y);
    for (auto y : g2[x]) if (!vis[y]) Dfs(y);
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1, x, y, z; i <= m; ++i) {
        cin >> x >> y >> z;
        if (z == 2) g[x].push_back(y);
        else g2[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i) if (!dfn[i]) {
        Tarjan(i);
    }
    for (int x = 1; x <= n; ++x) 
        for (auto y : g[x])
            if (col[y] != col[x]) 
                valid[col[x]] = 1;
    Dfs(1);
    cout << "No" << endl;
    return 0;
}