#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pi;
#define V vector
#define pb push_back
#define fi first
#define se second
#define all1(x) (x).begin() + 1, (x).end()

using i64 = int64_t;
constexpr int INF = 1e9;
const int MN = 3e5 + 10;
struct SCC {
    int n; 
    V<int> e[MN];
    int cnt;
    V<V<int>> scc;
    int dfn[MN], bel[MN], low[MN], tot, sz[MN];
    bool ins[MN];
    stack<int> st;
    void ini(int nn) {
        n = nn;
        tot = 0;
        for(int i =1 ; i <= n; i++) ins[i] = 1, dfn[i] = 0;
        scc.resize(1);
        for(int i = 1;i <= n; i++) e[i].clear();
    }
    void add(int a, int b) {
        e[a].pb(b);
    }
    void dfs(int x) {
        low[x] = dfn[x] = ++tot;
        st.push(x);
        for(auto y : e[x]) {
            if(!dfn[y]) dfs(y);
            if(ins[y]) low[x] = min(low[x], low[y]);
        }
        if(low[x] == dfn[x]) {
            scc.pb({});
            do {
                ins[st.top()] = 0;
                bel[st.top()] = scc.size() - 1;
                scc.back().pb(st.top());
                st.pop();
            } while(scc.back().back() != x);
        }
    }

    void tarjan() {
        for(int i =1 ;i <= n ;i++) if(!dfn[i]) dfs(i);
        reverse(all1(scc));
        cnt = scc.size() -1 ;
        for(int i = 1; i <= n; i++) bel[i] = cnt - bel[i] + 1;
    }
}scc;


int main() {
    int n, m; cin >> n >> m;
    scc.ini(n);
    V<pi> E1;
    V<V<int>> e(n + 1);
    for(int i = 1; i <= m; i++) {
        int a, b, t; cin >> a >> b >> t;
        if(t == 2) E1.pb({a, b}), scc.add(a, b);
        e[a].pb(b);
    }
    V<int> vis(n + 1);
    auto dfs = [&](int x, auto dfs) -> void {
        vis[x] = 1;
        for(auto y : e[x]) {
            if(!vis[y]) dfs(y, dfs);
        }
    };
    dfs(1, dfs);

    scc.tarjan();
    V<int> danger(n + 1);
    for(auto [x, y] : E1) 
        if(scc.bel[x] != scc.bel[y]) {
            danger[x] = 1;
            // cout << "x, y : " << x << " " << y << endl;
        }

    for(int i = 1; i <= n; i++) {
        if(vis[i] && danger[i]) {
            // cout << "at : " << i << endl;
            cout << "Yes" << endl;
            return 0;
        }
    }
    cout << "No" << endl;
}