#include<bits/stdc++.h>
using namespace std;
int n,m;
bool vis[301000];
#define pb push_back
vector<int>g1[300100],g[300100];
void bfs(){
    queue<int>q;q.push(1),vis[1]=1;
    while(!q.empty()){
        int u=q.front();q.pop();
        for(int v:g1[u])if(!vis[v])vis[v]=1,q.push(v);
    }
}
int dfn[300100],low[301000],sta[300100],top;bool in[301000];
void dfs(int x){
    dfn[x]=low[x]=++dfn[0],sta[++top]=x,in[x]=1;
    for(int v:g[x]){
        if(!dfn[v])dfs(v),low[x]=min(low[x],low[v]);
        else if(in[v])low[x]=min(low[x],dfn[v]);
    }
    if(dfn[x]==low[x]){
        int f1=0,f2=0;
        while(sta[top]!=x)f1+=vis[sta[top]],f2++,in[sta[top--]]=0;
        f1+=vis[x],f2++,in[x]=0,top--;
        if(f1&&f2==1&&!g[x].empty()){puts("Yes");exit(0);}
    }
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1,u,v,w;i<=m;i++){
        scanf("%d%d%d",&u,&v,&w);
        if(w==1)g1[u].pb(v);else g[u].pb(v);
    }
    bfs();for(int i=1;i<=n;i++)if(!dfn[i])dfs(i);
    puts("No");
    return 0;
}