stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int n,m,dis[200001],l,r,d;

bool Error,f[200001];

struct edge {

	int to,cost;

	edge(int a=0,int b=0) {

		to=a;

		cost=b;

	}

};

vector<edge> path[200001];

void spfa(int x) {

	for(int i=0; i<path[x].size(); i++) {

		edge e=path[x][i];

		if(f[e.to])

			if(e.cost+dis[x]!=dis[e.to]) {

				Error=true;

				return;

			} else continue;

		f[e.to]=true;

		dis[e.to]=dis[x]+e.cost;

		spfa(e.to);

		if(Error) return;

	}

}

int main() {

	cin>>n>>m;

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

		scanf("%d%d%d",&l,&r,&d);

		path[l].push_back(edge(r,d));

		path[r].push_back(edge(l,-d));

	}

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

		if(!f[i]) {

			spfa(i);

			if(Error) break;

		}

	}

	if(!Error) printf("Yes");

	else printf("No");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 6.524295483808788x):
#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <queue>

#include <cmath>

using namespace std;



int N,M,cnt;

int head[100050];

long long dis[100050];

bool vis[100050],inq[100050];

struct edge{

    int u,v,w,next;

}t[400050];

inline void read(int& x){

    char c=getchar();

    x=0;

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

    while(c>='0'&&c<='9')

    {

        x=x*10+c-'0';

        c=getchar();

    }

}

inline void add(int u,int v,int w){

    t[++cnt].u=u;

	t[cnt].v=v;

    t[cnt].w=w;

    t[cnt].next=head[u];

    head[u]=cnt;

}



queue<int>q;

inline bool spfa(int start){

    

    q.push(start);

    inq[start]=true;

    dis[start]=0;

    

    while(!q.empty()){

        int u=q.front();

        	q.pop();

        inq[u]=false;

    	

		for(int i=head[u];i;i=t[i].next){

            int v=t[i].v;

            	if(dis[v]==12345678987654321){

                	dis[v]=dis[u]+t[i].w;

                		vis[v]=true;

                	if(!inq[v])

                   		q.push(v);

            	}

            	else 

				if(dis[v]!=dis[u]+t[i].w)

                	return false;

        }

    }

    return true;

}



int main(){

	read(N),read(M);

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

    	int u,v,w;

        read(u),read(v),read(w);

        add(u,v,w),add(v,u,-w);

    }

    for(int i=1;i<=N;i++)

		dis[i]=12345678987654321;

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

        if(!vis[i]){

            vis[i]=true;

            	bool flag=spfa(i);

            	if(!flag){

                	printf("No\n");

                		return 0;

            	}

        }

    }

    printf("Yes\n");

    return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<iostream>

#include<cstring>

using namespace std;

struct node_ {

	int v,c,next;

} node[3000001];

int head[1000001],e;

void addnode(int u,int v,int c) {

	e++;

	node[e].c=c;

	node[e].v=v;

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

	head[u]=e;

}

int n,m;

bool b[1000001],flag;

int d[1000001];

int L,R,D;

bool dfs(int x) {

	b[x]=1;

	for(int i=head[x]; i!=0; i=node[i].next) {

		int y=node[i].v,c=node[i].c;

		if(d[y]>d[x]+c) {

			if(b[y]) return 1;

			d[y]=d[x]+c;

			if(dfs(y))return 1;

		}

	}

	b[x]=0;

	return 0;

}

int main() {

	scanf("%d%d",&n,&m);

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

		scanf("%d%d%d",&L,&R,&D);

		addnode(R,L,D);

		addnode(L,R,-D);

	}

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

		addnode(0,i,0);

	}

	memset(b,0,sizeof(b));

	memset(d,1000000,sizeof(d));

	d[0]=0;

	if(dfs(0)) printf("No\n");

	else printf("Yes\n");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 6.18968696341749x):
#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <queue>

#include <cmath>

using namespace std;



int N,M,cnt;

int head[100050];

long long dis[100050];

bool vis[100050],inq[100050];

struct edge{

    int u,v,w,next;

}t[400050];

inline void read(int& x){

    char c=getchar();

    x=0;

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

    while(c>='0'&&c<='9')

    {

        x=x*10+c-'0';

        c=getchar();

    }

}

inline void add(int u,int v,int w){

    t[++cnt].u=u;

	t[cnt].v=v;

    t[cnt].w=w;

    t[cnt].next=head[u];

    head[u]=cnt;

}



queue<int>q;

inline bool spfa(int start){

    

    q.push(start);

    inq[start]=true;

    dis[start]=0;

    

    while(!q.empty()){

        int u=q.front();

        	q.pop();

        inq[u]=false;

    	

		for(int i=head[u];i;i=t[i].next){

            int v=t[i].v;

            	if(dis[v]==12345678987654321){

                	dis[v]=dis[u]+t[i].w;

                		vis[v]=true;

                	if(!inq[v])

                   		q.push(v);

            	}

            	else 

				if(dis[v]!=dis[u]+t[i].w)

                	return false;

        }

    }

    return true;

}



int main(){

	read(N),read(M);

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

    	int u,v,w;

        read(u),read(v),read(w);

        add(u,v,w),add(v,u,-w);

    }

    for(int i=1;i<=N;i++)

		dis[i]=12345678987654321;

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

        if(!vis[i]){

            vis[i]=true;

            	bool flag=spfa(i);

            	if(!flag){

                	printf("No\n");

                		return 0;

            	}

        }

    }

    printf("Yes\n");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define base 200000

#define inf 0x3f3f3f3f

using namespace std;

int n,m,x,y,w,ans,maxn,minn,dist[100010],vi[100010];

vector<int> g[100010],l[100010];

queue<int> q;

bool flag=false;



bool spfa(int s){

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

	dist[s]=0,maxn=minn=0,q.push(s),vi[s]=1;

	while(!q.empty()){

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

		for(int i=0;i<g[u].size();i++){

			int v=g[u][i];

			if(!vi[v]){

				dist[v]=dist[u]+l[u][i];

				q.push(v),vi[v]=1;

				maxn=max(maxn,dist[v]),minn=min(minn,dist[v]);

			}

			else if(dist[v]!=dist[u]+l[u][i]) return true;

		}

	}

	return false;

}



int main(){

//	freopen("line.in","r",stdin);

//	freopen("line.out","w",stdout);

	scanf("%d%d",&n,&m);

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

		scanf("%d%d%d",&x,&y,&w);

		g[x].push_back(y),l[x].push_back(w),g[y].push_back(x),l[y].push_back(-w);

	}

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

		if(!vi[i]){

			flag=spfa(i);

			if(flag){

//				printf("impossible");

				printf("No");

				return 0;

			}

			ans=max(ans,maxn-minn);

		}

	}

//	printf("%d",ans);

	printf("Yes");

}

// Faster C++ solution for the same problem (measured speedup: 6.909028859808048x):
#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <queue>

#include <cmath>

using namespace std;



int N,M,cnt;

int head[100050];

long long dis[100050];

bool vis[100050],inq[100050];

struct edge{

    int u,v,w,next;

}t[400050];

inline void read(int& x){

    char c=getchar();

    x=0;

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

    while(c>='0'&&c<='9')

    {

        x=x*10+c-'0';

        c=getchar();

    }

}

inline void add(int u,int v,int w){

    t[++cnt].u=u;

	t[cnt].v=v;

    t[cnt].w=w;

    t[cnt].next=head[u];

    head[u]=cnt;

}



queue<int>q;

inline bool spfa(int start){

    

    q.push(start);

    inq[start]=true;

    dis[start]=0;

    

    while(!q.empty()){

        int u=q.front();

        	q.pop();

        inq[u]=false;

    	

		for(int i=head[u];i;i=t[i].next){

            int v=t[i].v;

            	if(dis[v]==12345678987654321){

                	dis[v]=dis[u]+t[i].w;

                		vis[v]=true;

                	if(!inq[v])

                   		q.push(v);

            	}

            	else 

				if(dis[v]!=dis[u]+t[i].w)

                	return false;

        }

    }

    return true;

}



int main(){

	read(N),read(M);

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

    	int u,v,w;

        read(u),read(v),read(w);

        add(u,v,w),add(v,u,-w);

    }

    for(int i=1;i<=N;i++)

		dis[i]=12345678987654321;

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

        if(!vis[i]){

            vis[i]=true;

            	bool flag=spfa(i);

            	if(!flag){

                	printf("No\n");

                		return 0;

            	}

        }

    }

    printf("Yes\n");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

const int N=1e6+10;

using namespace std;



inline int read(){

	char ch=getchar();int x=0,f=1;

	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}

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

	return x*f;

} 



struct node{

	int v,nxt,w;

}e[N<<1];

int head[N],cnt;

int dis[N],n,m,INF;

bool used[N],vis[N];



void add(int u,int v,int w){

	e[++cnt].v=v;

	e[cnt].w=w;

	e[cnt].nxt=head[u];

	head[u]=cnt;

}



bool spfa(int s){

	queue<int> q;

	q.push(s);

	vis[s]=true;

	dis[s]=0;

	while(!q.empty()){

		int u=q.front();

		q.pop();vis[u]=false;

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

			int v=e[i].v,w=e[i].w;

			if(dis[v]==INF){

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

				used[v]=true;

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

			}

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

		}

	}

	return true;

}



int main(){

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

	INF=dis[1];

	n=read(),m=read();

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

		int x=read(),y=read(),z=read();

		add(x,y,z);add(y,x,-z);

	}

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

		if(!used[i]){

			used[i]=true;

			if(!spfa(i)){

				printf("No");

				return 0;

			}

		}

	}

	printf("Yes");

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.123648055135424x):
#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <queue>

#include <cmath>

using namespace std;



int N,M,cnt;

int head[100050];

long long dis[100050];

bool vis[100050],inq[100050];

struct edge{

    int u,v,w,next;

}t[400050];

inline void read(int& x){

    char c=getchar();

    x=0;

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

    while(c>='0'&&c<='9')

    {

        x=x*10+c-'0';

        c=getchar();

    }

}

inline void add(int u,int v,int w){

    t[++cnt].u=u;

	t[cnt].v=v;

    t[cnt].w=w;

    t[cnt].next=head[u];

    head[u]=cnt;

}



queue<int>q;

inline bool spfa(int start){

    

    q.push(start);

    inq[start]=true;

    dis[start]=0;

    

    while(!q.empty()){

        int u=q.front();

        	q.pop();

        inq[u]=false;

    	

		for(int i=head[u];i;i=t[i].next){

            int v=t[i].v;

            	if(dis[v]==12345678987654321){

                	dis[v]=dis[u]+t[i].w;

                		vis[v]=true;

                	if(!inq[v])

                   		q.push(v);

            	}

            	else 

				if(dis[v]!=dis[u]+t[i].w)

                	return false;

        }

    }

    return true;

}



int main(){

	read(N),read(M);

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

    	int u,v,w;

        read(u),read(v),read(w);

        add(u,v,w),add(v,u,-w);

    }

    for(int i=1;i<=N;i++)

		dis[i]=12345678987654321;

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

        if(!vis[i]){

            vis[i]=true;

            	bool flag=spfa(i);

            	if(!flag){

                	printf("No\n");

                		return 0;

            	}

        }

    }

    printf("Yes\n");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define fr(i,a,b) for(register int i = a;i <= b;++i)

#define inf 0x3f3f3f3f

#define N 100010

#define M 200010

using namespace std;



struct edge{

	int to,nxt,w;

}e[M << 2];

int h[N],dis[N],vis[N];

int tot,n,m;



inline int read(){

	int x = 0,f = 1;char c = getchar();

	while(!isdigit(c)){if(c == '-')f = -1;c = getchar();}

	while(isdigit(c)){x = x * 10 + c - '0';c = getchar();}

	return f * x;

}



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

	e[++tot] = (edge){y,h[x],z};

	h[x] = tot;

}



inline int spfa(int s){

	queue<int>q;

	q.push(s);vis[s] = 1;dis[s] = 0;

	while(q.size()){

		int x = q.front();q.pop();

		for(register int i = h[x];i;i = e[i].nxt){

			int p = e[i].to;

			if(dis[p] == inf){

				dis[p] = dis[x] + e[i].w;

				if(!vis[p])vis[p] = 1,q.push(p);

			}

			else if(dis[p] != dis[x] + e[i].w)return 0;

		}

	}

	return 1;

}



int main(){

	n = read();m = read();

	if(!m){printf("Yes");return 0;}

	fr(i,1,m){

		int x = read(),y = read(),z = read();

		add(x,y,z);add(y,x,-z);

	}

	memset(dis,inf,sizeof(dis));

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

	fr(i,1,n)

		if(!vis[i]){

			int x = spfa(i);

			if(!x){printf("No");return 0;}

		}

	printf("Yes");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.809137610014826x):
#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <queue>

#include <cmath>

using namespace std;



int N,M,cnt;

int head[100050];

long long dis[100050];

bool vis[100050],inq[100050];

struct edge{

    int u,v,w,next;

}t[400050];

inline void read(int& x){

    char c=getchar();

    x=0;

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

    while(c>='0'&&c<='9')

    {

        x=x*10+c-'0';

        c=getchar();

    }

}

inline void add(int u,int v,int w){

    t[++cnt].u=u;

	t[cnt].v=v;

    t[cnt].w=w;

    t[cnt].next=head[u];

    head[u]=cnt;

}



queue<int>q;

inline bool spfa(int start){

    

    q.push(start);

    inq[start]=true;

    dis[start]=0;

    

    while(!q.empty()){

        int u=q.front();

        	q.pop();

        inq[u]=false;

    	

		for(int i=head[u];i;i=t[i].next){

            int v=t[i].v;

            	if(dis[v]==12345678987654321){

                	dis[v]=dis[u]+t[i].w;

                		vis[v]=true;

                	if(!inq[v])

                   		q.push(v);

            	}

            	else 

				if(dis[v]!=dis[u]+t[i].w)

                	return false;

        }

    }

    return true;

}



int main(){

	read(N),read(M);

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

    	int u,v,w;

        read(u),read(v),read(w);

        add(u,v,w),add(v,u,-w);

    }

    for(int i=1;i<=N;i++)

		dis[i]=12345678987654321;

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

        if(!vis[i]){

            vis[i]=true;

            	bool flag=spfa(i);

            	if(!flag){

                	printf("No\n");

                		return 0;

            	}

        }

    }

    printf("Yes\n");

    return 0;

}
// Slower C++ solution:
# include <cstring>

# include <cstdio>

# include <iostream>

# include <queue>

# define N 100050

# define M 200050 

# define WQD 0x7f7f7f7f

int n;

int m;

struct Edge{int next,to, w;}  e[M<<1];

int head[N+1]; 

int dis[N+1];

bool vis[N+1];

bool book[ N + 1 ] ;

bool spfa(int s);

using namespace std;

int main()

{

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

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

	ios::sync_with_stdio ( false ) ;

	int u,v,w;

	memset(head,-1,sizeof(head));

	cin>>n>>m;

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

	{

		cin>>u>>v>>w;

		e[i]=(Edge){head[u],v,w};head[u]=i;

		e[m+i]=(Edge){head[v],u,-w};head[v]=m+i;

	}

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

		if(!vis[i]) 

		{

			vis[i]=1;

			if(!spfa(i))  {cout<<"No";return 0;}

		}

	cout<<"Yes";

	return 0;

}

bool spfa(int s)

{

 	queue<int>q;

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

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

	dis[s]=0;

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

	while(q.size()>0)

	{

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

		book[k]=0;

		for(int i=head[k]; i!=-1; i=e[i].next)

		{

			int v=e[i].to;

			if(dis[v]==WQD ) 

			{				

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

				if( ! book[v])	{q.push(v);	book[v]=1;}

				vis[v]=1;

			}

			else if(  (dis[v]!=dis[k]+e[i].w) )	return false;

		}		

    }

	return true;

}

// Faster C++ solution for the same problem (measured speedup: 2.0899816462508407x):
#pragma GCC optimize(3,"Ofast","inline")

#pragma GCC optimize(2)

#include<cstring>

#include<cstdio>

#include<queue>

#define Re register int

using namespace std;

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

int x,y,z,n,m,o,op,dis[N],vis[N],pan[N],head[N];

struct QAQ{int w,to,next;}a[M];queue<int>Q;

inline void add(Re x,Re y,Re z){a[++o].to=y,a[o].w=z,a[o].next=head[x],head[x]=o;}

inline void in(Re &x){

	Re fu=0;x=0;char ch=getchar();

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

	while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();

	x=fu?-x:x;

}

inline int SPFA(Re st){

	dis[st]=0,pan[st]=1,Q.push(st);

	while(!Q.empty()){

		x=Q.front(),Q.pop();pan[x]=0,vis[x]=1;

		for(Re i=head[x],to;i;i=a[i].next)

			if(dis[to=a[i].to]==inf){

				dis[to]=dis[x]+a[i].w;

				if(!pan[to])pan[to]=1,Q.push(to);

			}

			else if(dis[to]!=dis[x]+a[i].w)return 1;

	}

	return 0;

}

int main(){

	in(n),in(m);

	for(Re i=0;i<=n;++i)dis[i]=inf;

	while(m--)in(x),in(y),in(z),add(x,y,z),add(y,x,-z);//a[y]-a[x]==z: a[y]-a[x]>=z且a[x]-a[y]>=-z 

	for(Re i=1;i<=n;++i)

		if(!vis[i])if(SPFA(i))return !puts("No");

	puts("Yes");

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=100005;

struct node

{

	int to;

	ll v;

	node(int a=0,int b=0){to=a;v=b;}

};

vector<node> path[N];

bool use[N];

ll d[N];

bool dfs(int o)

{

	use[o]=true;

	for(int i=path[o].size()-1;i>=0;i--)

	{

		node e=path[o][i];

		if(d[e.to]>d[o]+e.v)

		{

			if(use[e.to]) return true;

			d[e.to]=d[o]+e.v;

			if(dfs(e.to)) return true;

		}

	}

	use[o]=false;

	return false;

}

int main()

{

	int n,m,a,b;

	ll dd;

	scanf("%d%d",&n,&m);

	while(m--)

	{

		scanf("%d%d%lld",&a,&b,&dd);

		path[a].push_back(node(b,dd));

		path[b].push_back(node(a,-dd));

	}

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

	{

		d[i]=LLONG_MAX;

		path[0].push_back(node(i,0));

	}

	if(dfs(0)) puts("No");

	else puts("Yes");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.8258248939991284x):
#pragma GCC optimize(3,"Ofast","inline")

#pragma GCC optimize(2)

#include<cstring>

#include<cstdio>

#include<queue>

#define Re register int

using namespace std;

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

int x,y,z,n,m,o,op,dis[N],vis[N],pan[N],head[N];

struct QAQ{int w,to,next;}a[M];queue<int>Q;

inline void add(Re x,Re y,Re z){a[++o].to=y,a[o].w=z,a[o].next=head[x],head[x]=o;}

inline void in(Re &x){

	Re fu=0;x=0;char ch=getchar();

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

	while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();

	x=fu?-x:x;

}

inline int SPFA(Re st){

	dis[st]=0,pan[st]=1,Q.push(st);

	while(!Q.empty()){

		x=Q.front(),Q.pop();pan[x]=0,vis[x]=1;

		for(Re i=head[x],to;i;i=a[i].next)

			if(dis[to=a[i].to]==inf){

				dis[to]=dis[x]+a[i].w;

				if(!pan[to])pan[to]=1,Q.push(to);

			}

			else if(dis[to]!=dis[x]+a[i].w)return 1;

	}

	return 0;

}

int main(){

	in(n),in(m);

	for(Re i=0;i<=n;++i)dis[i]=inf;

	while(m--)in(x),in(y),in(z),add(x,y,z),add(y,x,-z);//a[y]-a[x]==z: a[y]-a[x]>=z且a[x]-a[y]>=-z 

	for(Re i=1;i<=n;++i)

		if(!vis[i])if(SPFA(i))return !puts("No");

	puts("Yes");

}
// Slower C++ solution:
#include<cstdio>

#include<vector>

using namespace std;

int a,b,c,n,m,dis[100005];

bool vis[100005];

struct edge{

	int to,v;

	edge(int a=0,int b=0){to=a;v=b;}

};

vector<edge> path[200005];

bool spfa(int x){

	vis[x]=true;

	for(int i=0;i<path[x].size();i++){

		edge e=path[x][i];

		if(dis[e.to]<dis[x]+e.v){

			if(vis[e.to])return true;

			dis[e.to]=dis[x]+e.v;

			if(spfa(e.to))return true;

		}

	}

	vis[x]=false;

	return false;

}

int main(){

	scanf("%d%d",&n,&m);

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

		scanf("%d%d%d",&a,&b,&c);//b-a=c

		path[b].push_back(edge(a,c));

		path[a].push_back(edge(b,-c));

	}

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

		dis[i]=-9999999;

		path[0].push_back(edge(i,0));

	}

	if(spfa(0))printf("No");

	else printf("Yes");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 6.931917458225865x):
#pragma GCC optimize(3,"Ofast","inline")

#pragma GCC optimize(2)

#include<cstring>

#include<cstdio>

#include<queue>

#define Re register int

using namespace std;

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

int x,y,z,n,m,o,op,dis[N],vis[N],pan[N],head[N];

struct QAQ{int w,to,next;}a[M];queue<int>Q;

inline void add(Re x,Re y,Re z){a[++o].to=y,a[o].w=z,a[o].next=head[x],head[x]=o;}

inline void in(Re &x){

	Re fu=0;x=0;char ch=getchar();

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

	while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();

	x=fu?-x:x;

}

inline int SPFA(Re st){

	dis[st]=0,pan[st]=1,Q.push(st);

	while(!Q.empty()){

		x=Q.front(),Q.pop();pan[x]=0,vis[x]=1;

		for(Re i=head[x],to;i;i=a[i].next)

			if(dis[to=a[i].to]==inf){

				dis[to]=dis[x]+a[i].w;

				if(!pan[to])pan[to]=1,Q.push(to);

			}

			else if(dis[to]!=dis[x]+a[i].w)return 1;

	}

	return 0;

}

int main(){

	in(n),in(m);

	for(Re i=0;i<=n;++i)dis[i]=inf;

	while(m--)in(x),in(y),in(z),add(x,y,z),add(y,x,-z);//a[y]-a[x]==z: a[y]-a[x]>=z且a[x]-a[y]>=-z 

	for(Re i=1;i<=n;++i)

		if(!vis[i])if(SPFA(i))return !puts("No");

	puts("Yes");

}
// Slower C++ solution:
#include <cstdio>

#include <iostream>

#include <algorithm>

#include <cstring>

#include <queue>



using namespace std;



struct edge

{

    int v,w,nxt;

}e[400050];



int head[100050],ecnt;



void adde(int u,int v,int w)

{

    e[++ecnt].v = v;

    e[ecnt].w = w;

    e[ecnt].nxt = head[u];

    head[u] = ecnt;

}



int N,M;

int l[200050],r[200050];

int d[200050];

long long dist[100005];

queue<int> que;

bool vis[100050],inq[100050];



bool spfa(int st)

{

    que.push(st);

    inq[st] = true;

    dist[st] = 0;

    long long curmax = 0,curmin = 0;

    while(!que.empty())

    {

        int u = que.front();

        que.pop();

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

        {

            int v = e[i].v;

            if(dist[v] == 12345678987654321)

            {

                dist[v] = dist[u] + e[i].w;

                curmax = max(curmax,dist[v]);

                curmin = min(curmin,dist[v]);

                if(curmax - curmin > 1000000000)

                    return false;

                vis[v] = 1;

                if(!inq[v])

                    que.push(v);

            }

            else if(dist[v] != dist[u] + e[i].w)

                return false;

        }

        inq[u] = false;

    }

    return true;

}



int main()

{

    for(int i = 1;i <= 100000; ++ i)

        dist[i] = 12345678987654321;

    scanf("%d%d",&N,&M);

    for(int i = 1;i <= M; ++ i)

    {

        scanf("%d%d%d",&l[i],&r[i],&d[i]);

        adde(l[i],r[i],d[i]);

        adde(r[i],l[i],-d[i]);

    }

    for(int i = 1;i <= N; ++ i)

    {

        if(!vis[i])

        {

            vis[i] = 1;bool l = spfa(i);

            if(!l)

            {

                printf("No\n");

                return 0;

            }

        }

    }

    printf("Yes\n");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.9528601638630012x):
#pragma GCC optimize(3,"Ofast","inline")

#pragma GCC optimize(2)

#include<cstring>

#include<cstdio>

#include<queue>

#define Re register int

using namespace std;

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

int x,y,z,n,m,o,op,dis[N],vis[N],pan[N],head[N];

struct QAQ{int w,to,next;}a[M];queue<int>Q;

inline void add(Re x,Re y,Re z){a[++o].to=y,a[o].w=z,a[o].next=head[x],head[x]=o;}

inline void in(Re &x){

	Re fu=0;x=0;char ch=getchar();

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

	while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();

	x=fu?-x:x;

}

inline int SPFA(Re st){

	dis[st]=0,pan[st]=1,Q.push(st);

	while(!Q.empty()){

		x=Q.front(),Q.pop();pan[x]=0,vis[x]=1;

		for(Re i=head[x],to;i;i=a[i].next)

			if(dis[to=a[i].to]==inf){

				dis[to]=dis[x]+a[i].w;

				if(!pan[to])pan[to]=1,Q.push(to);

			}

			else if(dis[to]!=dis[x]+a[i].w)return 1;

	}

	return 0;

}

int main(){

	in(n),in(m);

	for(Re i=0;i<=n;++i)dis[i]=inf;

	while(m--)in(x),in(y),in(z),add(x,y,z),add(y,x,-z);//a[y]-a[x]==z: a[y]-a[x]>=z且a[x]-a[y]>=-z 

	for(Re i=1;i<=n;++i)

		if(!vis[i])if(SPFA(i))return !puts("No");

	puts("Yes");

}