#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,K,Q,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
const ll INF = 1LL<<60;
typedef pair<ll, ll> P;
class union_find{
        vector<long> parent, tree_size;
    public:
        union_find(unsigned long _n) : parent(_n), tree_size(_n, 1){
            for(unsigned long i = 0; i < _n; ++i)parent[i] = i;
        }
        ll find(ll x){
            while(parent[x] != x)x = parent[x] = parent[parent[x]];
            return x;
        }
        void merge(ll a, ll b){
            a = find(a);
            b = find(b);
	    if(a==b) return;
            if(tree_size[a] < tree_size[b])swap(a, b);
            tree_size[a] += tree_size[b];
            parent[b] = a;
            return;
        }
	bool same(ll a, ll b){
	    a = find(a);
	    b = find(b);
	    return a == b;
	}
	ll p(ll a){return find(a);};
    };


mat G(int(1e+5) + 1, vec(0));
vec used(int(1e+5) + 10, 0);
bool dfs(int v){
    used[v] = 1;
    for(ll to : G[v]){
        if(used[to] == 0) {
            if(dfs(to)) return true;
        }else if(used[to] == 1){
            return true;
        }
    }
    used[v] = 2;
    return false;
}
int main() {
    cin>>N>>M;
    union_find uf(N + 10);
    vec a(M), b(M), c(M);
    rep(i,M) {
        cin>>a[i]>>b[i]>>c[i];
        --a[i];
        --b[i];
        if(c[i] == 1){
            if(uf.same(a[i], b[i])){
                cout<<"Yes"<<endl;
                return 0;
            }
            uf.merge(a[i], b[i]);
        }
    }
    rep(i,M){
        if(c[i] == 2){
            ll pa = uf.p(a[i]), pb = uf.p(b[i]);
            if(uf.same(pa, pb)){
                cout<<"Yes"<<endl;
                return 0;
            }
            G[pa].push_back(pb);
        }
    }
    int k = 0;
    rep(i,N){
        if(used[i] == 0) {
            if (dfs(i)) {
                cout << "Yes" << endl;
                return 0;
            }
        }
    }
    cout<<"No"<<endl;
}