#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>
#include <random>
#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 paredge, int curr)
{
    assert(vis[curr]==0);
    vis[curr]=1;
    int siz=(int)g[curr].size();
    int i;
    for(i=0; i<siz; i++) {
        int next=g[curr][i].first;
        int edge=g[curr][i].second;
        if(edge==paredge) continue;
        if(vis[next] && !fin[next]) {
            return true;
        }
        if(vis[next]) {
            continue;
        }
        if(dfs(edge,next)) {
            return true;
        }
    }
    fin[curr]=1;
    return false;
}
mt19937 mt(334);
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));
    }
    vector<int> ind(n);
    iota(ind.begin(), ind.end(), 0);
    shuffle(ind.begin(), ind.end(), mt);
    for(auto i:ind) {
        if(vis[i]) continue;
        bool ret=dfs(-1,i);
        if(ret){
            printf("Yes\n");
            return;
        }
    }
    printf("No\n");
    return;
}


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