// Slower C++ solution:
#ifndef chafen

#define chafen



# include <cstdio>

# include <iostream>

# include <cstring>

# include <queue>

# pragma GCC optimize(2)

# define N 300000

# define INF 0x7f7f7f7f //0x7fffffff

# define _cin std::ios::sync_with_stdio(false)

# define rg register

# define il inline

struct edge{

    int next;

    int to;

    int w;

}e[(N+1)<<1];

int head[N+1];

int book[N+1];

int vis[N+1];

int dis[N+1];

int n,m;

using namespace std;

//template <class A> il bool SPFA(A s);

bool SPFA(int s);

int main()

{

    _cin;

    rg int edge_sum=0;

    rg int u,v,w;

    cin>>n>>m;

    for(rg int i = 1;i<=m;i++){

        cin>>u>>v>>w;

        //edge_sum++;

        e[i].next=head[u];

        e[i].to=v;

        e[i].w=w;

        head[u]=i;

        

        //edge_sum++;

        e[i+m].next=head[v];

        e[i+m].to=u;

        e[i+m].w=-w;

        head[v]=i+m;

    }

    memset(dis,0x7f,sizeof(dis));

    memset(vis,0,sizeof(vis));

    memset(book,0,sizeof(book));

    for(rg int i = 1;i<=n;i++){

        if(!vis[i]){

            vis[i]=1;

            if(!SPFA(i)){

                cout<<"No"<<endl;

                return 0;

            }

        }

    }

    cout<<"Yes"<<endl;

    return 0;

}

//template <class A> il bool SPFA(A s)

il bool SPFA(int s)

{

    queue <int> q;

    dis[s]=0;

    q.push(s);book[s]=1;

    while(q.size()>0){

        rg int k=q.front();q.pop();

        book[k]=0;

        for(rg int i = head[k];i;i=e[i].next){

            rg int tt=e[i].to;

            if(dis[k]<INF && dis[tt]<INF && dis[tt]!=dis[k]+e[i].w) return false;

			else if(dis[k]<INF && dis[tt] == INF){

                dis[tt]=dis[k]+e[i].w;

                if(book[tt] == false) {q.push(tt);book[tt]=1;}

                vis[tt]=1;

            }

        }

    }

    return true;

}



#endif

// Faster C++ solution for the same problem (measured speedup: 3.3602663840298126x):
#include <bits/stdc++.h>

using namespace std;

const int N=1e5+5,M=2e5+5;

int n,m;



inline int in(){

	int x=0;char ch=getchar();

	while(ch>'9'||ch<'0') ch=getchar();

	while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();

	return x;

}



int cnt,head[N],to[2*M],wi[2*M],nxt[2*M];

inline void adds(int x,int y,int z){

	to[++cnt]=y,wi[cnt]=z,nxt[cnt]=head[x],head[x]=cnt;

	return ;

}



inline void solve_in(){

	int a,b,c;

	n=in(),m=in();

	for(int i=1;i<=m;i++){

		a=in(),b=in(),c=in();

		adds(a,b,c),adds(b,a,-c);

	}

	return ;

}



bool co[N];

int dis[N];

bool vis[N];

queue< int > Q;

inline bool SPFA(int st){

	int mis=0,mas=0;

	dis[st]=0,vis[st]=true,Q.push(st);

	while(!Q.empty()){

		int u=Q.front();Q.pop();

		vis[u]=false,co[u]=true;

		for(int i=head[u];i;i=nxt[i]){

			int v=to[i],w=wi[i];

			co[v]=true;

			if(dis[v]==0x3f3f3f3f){

				dis[v]=dis[u]+w;

				mas=max(mas,dis[v]);

				mis=min(mis,dis[v]);

				if(mas-mis>1e9) return false;

				if(!vis[v]) vis[v]=true,Q.push(v);

			}

			else if(dis[v]!=dis[u]+w) return false;

		}

	}

	return true;

}



int main(){

	solve_in();

	memset(dis,0x3f,sizeof(dis));

	for(int i=1;i<=n;i++){

		if(!co[i]){

			if(!SPFA(i)){

				puts("No");

				return 0;

			}

		}

	}

	puts("Yes");

	return 0;

}