#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 

typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;

vector<vector<pair<int,int> > > g;   // to,edge
vector<int> vis,fin;

bool dfs(int curr)
{
    assert(vis[curr]==0);
    vector<pair<int,int> > z;
    {
        int siz=(int)g[curr].size();
        if(siz==0) {
            vis[curr]=fin[curr]=1;
        }
        int i;
        for(i=0; i<siz; i++) {
            int next=g[curr][i].first;
            int edge=g[curr][i].second;
            z.push_back(make_pair(curr,i));
        }
    }
    while(!z.empty()) {
        int curr=z.back().first;
        int id=z.back().second;
        z.pop_back();
        int next=g[curr][id].first;
        int edge=g[curr][id].second;
        if(vis[next] && !fin[next]) {
            return true;
        }
        if(vis[next]) {
            continue;
        }

        {
            int siz=(int)g[next].size();
            if(siz==0) {
                vis[curr]=fin[curr]=1;
            }
            int i;
            for(i=0; i<siz; i++) {
                int next2=g[next][i].first;
                int edge2=g[next][i].second;
                if(edge2==edge) continue;
                z.push_back(make_pair(next,i));
            }
        }
        vis[curr]=1;
        if(id==0) fin[curr]=1;
    }
    return false;
}

void solve()
{
    int n,m;
    scanf("%d%d", &n, &m);
    g.resize(n);
    vis.resize(n); fin.resize(n);
    int i;
    for(i=0; i<m; i++) {
        int a,b,c;
        scanf("%d%d%d", &a, &b,&c); a--; b--;
        g[a].push_back(make_pair(b,i));
        if(c==1) g[b].push_back(make_pair(a,i));
    }
    for(i=0; i<n; i++) {
        if(vis[i]) continue;
        bool ret=dfs(i);
        if(ret){
            printf("Yes\n");
            return;
        }
    }
    printf("No\n");
    return;
}


int main(int argc, char* argv[])
{
	solve();
	return 0;
}