/*#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <array>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
*/

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define SORT(c) sort((c).begin(),(c).end())

typedef long long ll;
const ll INF = LLONG_MAX - 100;
const ll mod = 1e9 + 7;
const int MAX_N = 5e5 + 5;
int dx[] = { -1LL,0,1LL,0 }, dy[] = { 0,1LL,0,-1LL };
vector<ll> prime;

ll inv[MAX_N], fac[MAX_N];

template <class T = ll> T in() { T x; cin >> x; return (x); }
inline ll GCD(ll a, ll b) { ll c; while (b != 0) { c = a % b; a = b; b = c; }return a; }
inline ll LCM(ll a, ll b) { return a * b / GCD(a, b); }
inline ll POW(ll a, ll b) { ll c = 1LL; while (b > 0) { if (b & 1LL) { c = a * c%mod; }a = a * a%mod; b >>= 1LL; }return c; }
inline void _nCr() { fac[0] = 1LL; for (int i = 1LL; i < MAX_N; i++) { fac[i] = fac[i - 1LL] * i%mod; }for (int i = 0; i < MAX_N; i++) { inv[i] = POW(fac[i], mod - 2); } }
inline ll nCr(ll n, ll r) { return (fac[n] * inv[r] % mod)*inv[n - r] % mod; }
inline void PRI(ll n) { bool a[n + 1LL]; for (int i = 0; i < n + 1LL; i++) { a[i] = 1LL; }for (int i = 2; i < n + 1LL; i++) { if (a[i]) { prime.pb(i); ll b = i; while (b <= n) { a[b] = 0; b += i; } } } }

typedef pair<int, pair<int, int>> edge;

class UnionFind {
private:
	vector<int> par;
public:
	UnionFind(int N) { par = vector<int>(N, -1LL); }
	int find(int x);
	ll size(int x);
	void unite(int x, int y);
	bool same(int x, int y);
};



class Kruskal {
private:
	UnionFind *uf;
	vector<edge> e;
public:
	vector<edge> mst;
	Kruskal(int N) { uf = new UnionFind(N); }
	void add(int x, int y, ll z);
	void run();
};



//----UnionFind-------------------------------
int UnionFind::find(int x) {
	if (par[x] < 0) return x;
	else return par[x] = find(par[x]);
}

ll UnionFind::size(int x) {
	return -par[find(x)];
}

void UnionFind::unite(int x, int y) {
	x = find(x);
	y = find(y);

	//大きい方に小さい方をくっ付ける
	if (size(x) < size(y)) swap(x, y);
	par[x] += par[y];
	par[y] = x;
}

bool UnionFind::same(int x, int y) {
	x = find(x);
	y = find(y);
	return x == y;
}



//----Kruskal-------------------------------
void Kruskal::add(int x, int y, ll z) {
	//x < y
	if (x > y) swap(x, y);
	e.push_back({ z,{x,y} });
}

void Kruskal::run() {
	sort(e.begin(), e.end());
	e.erase(unique(e.begin(), e.end()), e.end());
	for (auto x : e) {
		if (uf->same(x.second.first, x.second.second)) {
			continue;
		}
		else {
			mst.push_back(x);
			uf->unite(x.second.first, x.second.second);
		}
	}
}

// class segtree {
// public:
// 	int p = 2;
// 	vector<int> B;
// 	segtree(vector<int> &A) {
// 		while (A.size() > p) p *= 2;
// 		B = vector<int>(2*p-1,INF);
// 		for (int i = 0;i < A.size();i++) {
// 			B[p-1+i] = A[i];
// 		}
// 		for (int i = p - 2;i >= 0;i--) {
// 			B[i] = min(B[i*2+1],B[i*2+2]);
// 		}
// 	}

// 	void update(int pos) {
// 		pos += p-1;
// 		B[pos] = {'~',0};
// 		pos = (pos-1)/2;
// 		while (pos >= 0) {
// 			B[pos].first = min(B[pos*2+1].first,B[pos*2+2].first);
// 			B[pos].second = B[pos*2+1].second + B[pos*2+2].second;
// 			if (pos == 0) break;
// 			pos = (pos-1)/2;
// 		}
// 	}

// 	int getval(int start,int end,int k = 0,int l = 0,int r = -1) {
// 		if (r < 0) r = p - 1;
// 		if (start <= l && r <= end) {return B[k];}
// 		if (r < start || end < l) {return INF;}
// 		int L,R;
// 		L = getval(start,end,k*2+1,l,(l+r)/2);
// 		R = getval(start,end,k*2+2,(l+r)/2+1,r);
// 		return min(L,R);
// 	}
// };

int dis[100005];
vector<vector<pair<int,int>>> ed(100005);

signed main() {
	int n,m; cin >> n >> m;
	REP (i,m) {
		int l,r,d; cin >> l >> r >> d;
		ed[l].push_back({r,d});
		ed[r].push_back({l,-d});
	}
	REP (i,100005) dis[i] = -INF;
	REP (i,n) {
		if (dis[i] == -INF) {
			dis[i] = 0;
			queue<int> p;
			p.push(i);
			while (!p.empty()) {
				int here = p.front(); p.pop();
				REP (j,ed[here].size()) {
					if (dis[ed[here][j].first] == -INF) {
						dis[ed[here][j].first] = dis[here] + ed[here][j].second;
						p.push(ed[here][j].first);
					}
					else if (dis[ed[here][j].first] != dis[here] + ed[here][j].second) {
						
						// cout << i << ed[here][j].first << dis[ed[here][j].first] << endl;
						cout << "No" << endl;
						return 0;
					}
				}
			}
		}
	}
	cout << "Yes" << endl;
}


Measured memory_bytes: 14080