/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
int n,m;
vector <int> g[300005];
int dfn[1000005],low[1000005],siz[1000005],times,scccnt,bl[1000005],vis[1000005],stk[1000005],top;
void tarjan(int u)
{
	dfn[u]=low[u]=++times;
	vis[u]=1,stk[++top]=u;
	for(int i=0;i<g[u].size();i++)
	{
		int v=g[u][i];
		if(!dfn[v])
		{
			tarjan(v);
			low[u]=min(low[u],low[v]);
		}
		else if(vis[v]) low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u])
	{
		scccnt++;
		while(1)
		{
			int x=stk[top];
			top--;
			bl[x]=scccnt,vis[x]=0,siz[scccnt]++;
			if(x==u) break;
		}
	}
}
int U[300005],V[300005],T[300005],ok[300005],cyc[300005];
void dfs0(int u)
{
	ok[u]=1;
	for(int i=0;i<g[u].size();i++) if(!ok[g[u][i]]) dfs0(g[u][i]);
}
void solve()
{
	cin>>n>>m;
	for(int i=1;i<=m;i++) cin>>U[i]>>V[i]>>T[i];
	for(int i=1;i<=m;i++) g[U[i]].pb(V[i]);
	dfs0(1);
	for(int i=1;i<=n;i++) g[i].clear();
	for(int i=1;i<=m;i++) if(T[i]==2) 
	{
		g[U[i]].pb(V[i]);
		if(U[i]==V[i]) cyc[i]=1;
	}
	for(int i=1;i<=n;i++) if(!dfn[i]) tarjan(i);
	for(int i=1;i<=n;i++) if(ok[i]&&siz[bl[i]]==1&&cyc[i]==0)
	{
		cout<<"Yes\n";
		return;
	}
	cout<<"No\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}