#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

const int N=3e5+5;
vector<pair<int,int> >G[N];
int n,m,ban[10];

int low[N],dfn[N],dfc,stk[N],top,scc[N],sc,sz[N];
bool ins[N],can[N];
void dfs(int u){
	// cout<<"dfs "<<u<<endl;
	stk[++top]=u,dfn[u]=low[u]=++dfc,ins[u]=1;
	for(auto [v,w]:G[u]){
		if(ban[w])continue;
		// cout<<" -> "<<v<<endl;
		if(!dfn[v])dfs(v),cmin(low[u],low[v]);
		else if(ins[v])cmin(low[u],dfn[v]);
	}
	// cout<<"u = "<<u<<" dfn = "<<dfn[u]<<" low = "<<low[u]<<endl;
	if(dfn[u]!=low[u])return ;
	scc[u]=++sc,ins[u]=0,sz[sc]=1;
	while(stk[top]!=u)scc[stk[top]]=sc,ins[stk[top]]=0,top--,sz[sc]++;top--;
}

struct Edge{int u,v,t;Edge(int U=0,int V=0,int T=0):u(U),v(V),t(T){}};
vector<Edge>edges;
vector<int>G2[N];

void solve(){
	n=read(),m=read(),ban[1]=1;
	for(int i=1;i<=m;i++){
		int u=read(),v=read(),t=read();
		edges.emplace_back(Edge(u,v,t));
		G[u].emplace_back(mk(v,t));
	}
	for(int i=1;i<=n;i++)if(!dfn[i])dfs(i);
	for(int i=1;i<=n;i++)can[i]=(sz[scc[i]]<=1);
	// cout<<"scc = ";for(int i=1;i<=n;i++)cout<<scc[i]<<" ";puts("");
	// cout<<"can = ";for(int i=1;i<=n;i++)cout<<can[i]<<" ";puts("");

	memset(dfn,0,sizeof(dfn)),memset(low,0,sizeof(low));
	memset(stk,0,sizeof(stk)),memset(scc,0,sizeof(scc));
	memset(ins,0,sizeof(ins)),dfc=top=sc=0;


	ban[1]=0;vector<int>ind(n+1,0);
	for(int i=1;i<=n;i++)if(!dfn[i])dfs(i);
	for(auto [u,v,w]:edges){
		u=scc[u],v=scc[v];
		if(u==v)continue;
		G2[v].emplace_back(u),ind[u]++;
	}
	queue<int>q;
	for(int i=1;i<=sc;i++)if(ind[i]==0)q.push(i);
	while(q.size()){
		int x=q.front();q.pop();
		for(int y:G2[x]){
			can[y]|=can[x];
			if(--ind[y]==0)q.push(y);
		}
	}

	if(can[scc[1]])puts("Yes");
	else puts("No");
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
#endif

	solve();

	return 0;
}