stablegradients/pie-gem5-pairs huggingface dataset:
// 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: 1.9566441759940376x):
#include<iostream>

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else printf("Yes\n");

	return 0;

}
// 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.581743414180181x):
#include<iostream>

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else printf("Yes\n");

	return 0;

}
// 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.489672264557847x):
#include<iostream>

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else printf("Yes\n");

	return 0;

}
// 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.580761904816048x):
#include<iostream>

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else 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.243257417246083x):
#include<iostream>

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else printf("Yes\n");

	return 0;

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

using namespace std;

const int MAXN=100007;

typedef long long ll;

struct node {

    int v,w;

    node(int x=0,int y=0) {

        v=x,w=y;

    }

};

int deg[MAXN],X,n,m,x1,x2,y,tot[MAXN];

ll pos[MAXN];

bool vis[MAXN];

char c;

vector<node> edge[MAXN];

inline char nc(){

	static char buf[100000],*p1=buf,*p2=buf;

	return p2==p1&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;

}

int read() {

    X=0,c=nc();

    while(!isdigit(c))c=nc();

    while(isdigit(c))X=(X<<1)+(X<<3)+c-'0',c=nc();

    return X;

}

bool ok;

bool check(int &u) {

    vis[u]=true;

    for(int i=0; i<tot[u]; i++) {

        if(vis[edge[u][i].v]) {

            if(pos[edge[u][i].v]-edge[u][i].w!=pos[u])return false;

        } else {

            pos[edge[u][i].v]=pos[u]+edge[u][i].w;

            if(!check(edge[u][i].v))return false;

            else continue;

        }

    }

    return true;

}

int main() {

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

        if(!m){

            puts("Yes");

            return 0;

        }

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

            x1=read(),x2=read(),y=read();

            tot[x1]++;

            deg[x2]++;

            edge[x1].push_back(node(x2,y));

        }

        for(int i=0; i<n; i++)if(!deg[i]&&tot[i]) {

                ok=1;

                if(!check(i)) {

                    puts("No");

                    return 0;

                }

            };

        if(!ok) {

            puts("No");

            return 0;

        }

        puts("Yes");

        return 0;

}

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

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else 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.968825068198273x):
#include<iostream>

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else printf("Yes\n");

	return 0;

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

#include<cstring>

#include<iostream>

#include<algorithm>

#define int long long

using namespace std;

int n,m,cnt=0;

int head[410000],nxt[410000],to[410000],val[410000];

int ma=0,mi=0;

int q[1000000],dis[100100],f[100100],vis[100100];

void addedge(int x,int y,int z)

{

    cnt++;

    nxt[cnt]=head[x];

    head[x]=cnt;

    to[cnt]=y;

    val[cnt]=z;

}

bool spfa(int x)

{

    int l=0,r=1;

    q[1]=x;vis[x]=1;dis[x]=0;

    while(l<r)

    {

        int u=q[++l];

        for(int i=head[u];i!=-1;i=nxt[i])

        {

            int v=to[i];

            if(dis[v]==12345678987654321)

            {

                dis[v]=dis[u]+val[i];

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

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

                if(ma-mi>1e9) return 0;

                vis[v]=1;

                if(!f[v]) q[++r]=v,f[v]=1;

            }

            else if(dis[v]!=dis[u]+val[i]) return 0;

        }

        f[u]=0;

    }

    return 1;

}

signed main()

{

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

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

        dis[i]=12345678987654321;

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

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

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

    {

        int x,y,z;

        scanf("%lld%lld%lld",&x,&y,&z);

        addedge(x,y,z);

        addedge(y,x,-z);

    }

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

        if(!vis[i]) {if(!spfa(i)) {printf("No");return 0;}}

    printf("Yes");

    return 0;

}

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

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else printf("Yes\n");

	return 0;

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

using namespace std;

inline void fff(){

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

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

}

const int N=1e5+10;

const int INF=0x3f3f3f3f;

inline int read(){

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

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

	if(ch=='-') ch=getchar(),m=-1;

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

		x=x*10+ch-'0',ch=getchar();

	return x*m;

}

int n,m;

struct Edge{

	int nxt;

	int to,w;

}edge[N<<2];

int head[N],tot=0;

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

	edge[++tot].nxt=head[u];

	edge[tot].to=v;

	edge[tot].w=w;

	head[u]=tot;

}

bool visited[N];

int dist[N],ans,minn,maxx;

queue<int> q;

inline bool SPFA(int str){

	

	q.push(str);

	if(m) minn=INF,maxx=0;

	dist[str]=0;visited[str]=true;

	while(!q.empty()){

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

		visited[u]=false;

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

			Edge e=edge[i];

			if(dist[e.to]<INF){

				if(dist[e.to]!=e.w+dist[u]){

					return false;

				}

				minn=min(minn,dist[e.to]);

				maxx=max(maxx,dist[e.to]);

			}else{

				dist[e.to]=dist[u]+e.w;

				minn=min(minn,dist[e.to]);

				maxx=max(maxx,dist[e.to]);

				if(!visited[e.to]){

					visited[e.to]=true;

					q.push(e.to);

				}

			}

		}

	}

	ans=min(ans,maxx-minn);

	return true;

}

int main(){

//	fff();

	n=read();

	m=read();

	ans=INF;

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

		int u,v,w;

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

		add(u,v,w);

		add(v,u,-w);

	}

	memset(dist,INF,sizeof(dist));

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

		if(dist[i]<INF)  continue;

		if(!SPFA(i)){

			printf("No");

			return 0;

		}

	}

	printf("Yes");

}

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

#include<cstdio>

#include<algorithm>

#include<queue>

#include<cstring>

#define int long long

#define maxn 100001

#define inf 20000000000011



using namespace std;



int n,m,dis[maxn],head[maxn],cnt;

bool vis[maxn];

int use[maxn];



int read()

{

	int ans;char c;bool o=false;

	while((c=getchar())<'0' || c>'9') if(c=='-') o=true ; ans=c-48;

	while((c=getchar())>='0' && c<='9') ans=(ans<<1)+(ans<<3)+c-48;

	return o==true?-ans:ans;

}



struct node

{

	int son,val,nxt;

}edge[maxn<<2];



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

{

	edge[++cnt].son=y;

	edge[cnt].val=z;

	edge[cnt].nxt=head[x];

	head[x]=cnt;

}



bool spfa(int x)

{

	vis[x]=1;

	use[x]=1;

	for(int i=head[x];i;i=edge[i].nxt)

	{

		int y=edge[i].son,z=edge[i].val;

		if(dis[y]>dis[x]+z)

		{

			dis[y]=dis[x]+z;

			if(vis[y] || spfa(y)) return 1;

		}

	}

	vis[x]=0;

	return 0;

}



signed main()

{

	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);

	}

	bool ok=0;

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

    {

        if(!use[i])

        {

            dis[i]=0;

            if(spfa(i))

                ok=1;

        }

    }

    if(ok)printf("No\n");

    else printf("Yes\n");

	return 0;

}