#include <bits/stdc++.h>
using namespace std;

typedef int uci;
#define int long long
#define ll long long
#define F first
#define S second
#define ar array

vector<vector<pair<ll,ll>>> adj;

vector<ll> val, comp, z, cont;
ll T, ncomps;
ll dfs(ll j) {
    int lo = val[j] = ++T, x; z.push_back(j);
    for(auto e: adj[j]) {
        if(e.S != 2) continue;
        if(comp[e.F] < 0) lo = min(lo, val[e.F] ?: dfs(e.F));
    }
    if(lo == val[j]) {
        do {
            x = z.back(); z.pop_back(); 
            comp[x] = ncomps;
            cont.push_back(x);
        } while(x != j);
        cont.clear();
        ncomps++;
    }

    return val[j] = lo;

}

void solve(){
    ll N, M;
    cin >> N >> M;

    adj = vector<vector<pair<ll,ll>>>(N);

   

    for(int i = 0; i < M; i++) {
        ll u,v,t;
        cin >> u >> v >> t;
        u--;
        v--;
        adj[u].push_back({v,t});
    }

    // condition: does there exist a reachable node such that it has a 1-edge going somewhere else but no 1-cycle going to it.

    vector<ll> vis;

    vector<bool> seen(N, false);

    vector<ll> vq; vq.push_back(0);

    while(vq.size()) {
        ll n = vq.back(); vq.pop_back();
        if(seen[n]) continue;
        vis.push_back(n); seen[n] = true;
        for(auto a: adj[n]) vq.push_back(a.S);
    }

    val.assign(N,0); comp.assign(N,-1);T=ncomps=0;
    for(int i = 0; i < N; i++) if(comp[i] < 0) dfs(i);

    bool c = false;
    for(auto v: vis) {
        for(auto a: adj[v]) {
            if(a.S != 2) continue;
            //cout << v << " " << a.F << std::endl;
            c = c || (comp[a.F] != comp[v]);
        }
    }

    if(c) cout << "Yes\n";
    else cout << "No\n";



}

uci main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    solve();
}