// Slower C++ solution:
#ifndef _GLIBCXX_NO_ASSERT

#include <cassert>

#endif

#include <cctype>

#include <cerrno>

#include <cfloat>

#include <ciso646>

#include <climits>

#include <clocale>

#include <cmath>

#include <csetjmp>

#include <csignal>

#include <cstdarg>

#include <cstddef>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>



#if __cplusplus >= 201103L

#include <ccomplex>

#include <cfenv>

#include <cinttypes>

#include <cstdbool>

#include <cstdint>

#include <ctgmath>

#include <cwchar>

#include <cwctype>

#endif



// C++

#include <algorithm>

#include <bitset>

#include <complex>

#include <deque>

#include <exception>

#include <fstream>

#include <functional>

#include <iomanip>

#include <ios>

#include <iosfwd>

#include <iostream>

#include <istream>

#include <iterator>

#include <limits>

#include <list>

#include <locale>

#include <map>

#include <memory>

#include <new>

#include <numeric>

#include <ostream>

#include <queue>

#include <set>

#include <sstream>

#include <stack>

#include <stdexcept>

#include <streambuf>

#include <string>

#include <typeinfo>

#include <utility>

#include <valarray>

#include <vector>



#if __cplusplus >= 201103L

#include <array>

#include <atomic>

#include <chrono>

#include <condition_variable>

#include <forward_list>

#include <future>

#include <initializer_list>

#include <mutex>

#include <random>

#include <ratio>

#include <regex>

#include <scoped_allocator>

#include <system_error>

#include <thread>

#include <tuple>

#include <typeindex>

#include <type_traits>

#include <unordered_map>

#include <unordered_set>

#endif



using namespace std;



#define times(n, i)      uptil(0, n, i)

#define rtimes(n, i)     downto((n) - 1, 0, i)

#define upto(f, t, i)    for(auto i##0_to = (t), i = decltype(t)(f); i <= i##0_to; i++)

#define uptil(f, t, i)   for(auto i##0_to = (t), i = decltype(t)(f); i <  i##0_to; i++)

#define downto(f, t, i)  for(auto i##0_to = decltype(f)(t), i = (f); i >= i##0_to; i--)

#define downtil(f, t, i) for(auto i##0_to = decltype(f)(t), i = (f); i >  i##0_to; i--)

// types

	using LD = long double;

	#define double LD

	#define long long long

	#define int long

	using VB = vector<bool>;   using WB = vector<VB>;

	using VC = vector<char>;   using WC = vector<VC>;

	using VI = vector<int>;    using WI = vector<VI>;

	using VD = vector<double>; using WD = vector<VD>;

	using VS = vector<string>; using WS = vector<VS>;

	using PI = pair<int, int>;

	using TI = tuple<int, int, int>;

	using VPI = vector<PI>;    using WPI = vector<VPI>;



bool debug;

#define _GLIBCXX_DEBUG

#define _LIBCPP_DEBUG 2

#define _LIBCPP_DEBUG2 2

#define ln << '\n'

#define tb << '\t'

#define sp << ' '

#define db(x) if(debug) cerr << #x << " = " << (x) << ", "

#define dbg(x) if(debug) cerr << #x << " = " << (x) ln



void solve();



signed main(signed argc, char *argv[]) {

	#ifdef EBUG

		debug = true;

	#elif defined(ONLINE_JUDGE)

		debug = false;

	#else

		debug = argc >= 2;

	#endif

	if(!debug) {

		cin.tie(0);

		ios::sync_with_stdio(0);

	}

	cout << fixed << setprecision(20);

	cerr << fixed << setprecision(20);



	solve();



	return 0;

}



/******************************* basic library ********************************/

// IO

	template<class T>

	istream& operator>>(istream& s, vector<T>& v) {

		for(auto&& p : v) s >> p; return s;

	}

	template<class T>

	ostream& operator<<(ostream& s, vector<T> v) {

		int i = 0;

		for(const auto& p : v) s << (i++?" ":"") << p;

		return s;

	}

	template<class T>

	ostream& operator<<(ostream& s, vector<vector<T>> w) {

		for(const auto& v : w) {

			int i = 0;

			for(const auto& p : v) s << (i++?" ":"") << p;

			s ln;

		}

		return s;

	}

	template<class T> T& RD(T& t) { cin >> t; return t; }

	template<class T, class... A> T RD(A... a) { T t(a...); cin >> t; return t; }

// container

	#define all(v) (v).begin(), (v).end()

	template<class T> T max(const pair<T, T>& p) { return max(p.first, p.second); }

	template<class T> T min(const pair<T, T>& p) { return min(p.first, p.second); }

// other

	#define b_max(x, y) x = max(x, y)

	#define b_min(x, y) x = min(x, y)

	inline LD AC(LD d) { return d ? d : 0; }

constexpr long INF = 1LL << 60;

constexpr long MOD = 1000000009; // 1000000007; // 998244353;



/****************************** optional library ******************************/





/************************************ main ************************************/



int N, M;

map<int, int> path[100010] = {};

int x[100010] = {};

bool visited[100010] = {};



void dfs(int i, int y) {

	if(x[i] == INF) x[i] = y;

	if(x[i] != y) {

		cout << "No" ln;

		exit(0);

	}

	if(visited[i]) return;

	visited[i] = true;

	for(auto& p : path[i]) {

		int j, t; tie(j, t) = p;

		dfs(j, y + t);

	}

}



void solve() {

	int N, M; scanf("%lld%lld", &N, &M);

	times(N, i) x[i] = INF;

	times(M, i) {

		int U, V, D; scanf("%lld%lld%lld", &U, &V, &D);

	    path[U-1][V-1] = D;

	    path[V-1][U-1] = -D;

	}

	times(N, i) {

		if(!visited[i]) dfs(i, 0);

	}



	cout << "Yes" ln;

}


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

using namespace std;



#define times(n, i)      uptil(0, n, i)

#define rtimes(n, i)     downto((n) - 1, 0, i)

#define upto(f, t, i)    for(auto i##0_to = (t), i = decltype(t)(f); i <= i##0_to; i++)

#define uptil(f, t, i)   for(auto i##0_to = (t), i = decltype(t)(f); i <  i##0_to; i++)

#define downto(f, t, i)  for(auto i##0_to = decltype(f)(t), i = (f); i >= i##0_to; i--)

#define downtil(f, t, i) for(auto i##0_to = decltype(f)(t), i = (f); i >  i##0_to; i--)

/** types **/

	using LD = long double;

	#define double LD

	#define long long long

	#define LL long

	#define int long

	template<class T> using vec = vector<T>;

	using VB = vec<bool>;	using WB = vec<VB>;

	using VC = vec<char>;	using WC = vec<VC>;

	using VI = vec<int>;	using WI = vec<VI>;

	using VD = vec<double>;	using WD = vec<VD>;

	using VS = vec<string>;	using WS = vec<VS>;

	using PI = pair<int, int>;	using VPI = vec<PI>; using WPI = vec<VPI>;

	using MI = map<int, int>;	using VMI = vec<MI>;



bool debug;

#define _GLIBCXX_DEBUG

#define _LIBCPP_DEBUG 2

#define _LIBCPP_DEBUG2 2

#define ln << '\n'

#define tb << '\t'

#define sp << ' '

#define dd(x) if(debug) cerr << #x << " = " << (x) << ", "

#define ddd(x) if(debug) cerr << #x << " = " << (x) ln

#define db dd

#define dbg ddd



void settings();

void solve();



signed main(signed argc, char *argv[]) {

	#ifdef EBUG

		debug = true;

	#elif defined(ONLINE_JUDGE)

		debug = false;

	#else

		debug = argc >= 2;

	#endif

	if(!debug) {

		cin.tie(0);

		ios::sync_with_stdio(0);

	}

	cout << fixed << setprecision(20);

	cerr << fixed << setprecision(20);



	settings();

	solve();



	return 0;

}



/******************************* basic library ********************************/

/** structure **/

	template<class T> struct Graph { bool directed = false; int nv = -1; int ne = -1; vec<map<int,T>> e;

		Graph<T> rev() { if(not directed) return *this; Graph<T> g = *this; for(auto& ei : g.e) ei.clear(); times(nv, i) for(auto& p : e[i]) g.e[p.first][i] = p.second; return g; }

	};

	using GraphI = Graph<int>;

/** IO **/

	template<class T> inline istream& operator>>(istream& s, vec<T>& v) { for(auto&& p : v) s >> p; return s; }

	int INPUT_GRAPH_index_sub = 1, INPUT_GRAPH_cost = 0; bool INPUT_GRAPH_allow_empty = false;

	template<class T> inline istream& operator>>(istream& s, Graph<T>& g) {

		const int sub = INPUT_GRAPH_index_sub, cost = INPUT_GRAPH_cost, emptyp = INPUT_GRAPH_allow_empty;

		if(g.nv + emptyp <= 0 and g.ne + emptyp <= 0) { s >> g.nv >> g.ne; } g.e = VMI(g.nv);

		times(g.ne, i) { int x, y; T d = cost; s >> x >> y; if(!d) s >> d; g.e[x - sub][y - sub] = d; if(not g.directed) g.e[y - sub][x - sub] = d; } return s;

	}

	template<class T, class S> inline ostream& operator<<(ostream&, const pair<T, S>&);

	template<class T>          inline ostream& operator<<(ostream&, const vec<T>&);

	template<class T, class S> inline ostream& operator<<(ostream&, const map<T, S>&);

	template<class T> inline ostream& operator<<(ostream&, const Graph<T>&);

	#define DEFINE_ITER_OUTPUT(s, x, sep) { int i = 0; for(const auto& x##0_elem : x) { if(i++) s << sep; s << x##0_elem; } return s; }

	template<class T, class S> inline ostream& operator<<(ostream& s, const pair<T, S>& p) { return s << "(" << p.first << "," << p.second << ")"; }

	template<class T>          inline ostream& operator<<(ostream& s, const vec<T>& v) DEFINE_ITER_OUTPUT(s, v, ' ')

	template<class T, class S> inline ostream& operator<<(ostream& s, const map<T, S>& m) DEFINE_ITER_OUTPUT(s, m, ' ')

	template<class T>          inline ostream& operator<<(ostream& s, const vec<vec<T>>& w) DEFINE_ITER_OUTPUT(s, w, '\n')

	template<class T, class S> inline ostream& operator<<(ostream& s, const vec<map<T, S>>& vm) DEFINE_ITER_OUTPUT(s, vm, '\n')

	template<class T> inline ostream& operator<<(ostream& s, const Graph<T>& g) { return s << "Graph(nv:" << g.nv << " ne:" << g.ne << " e:[" ln << g.e ln << "])"; }

	inline void RD() {}

	template<class T, class...S> inline T& RD(T& t, S&... s) { cin >> t; RD(s...); return t; } /* returns first side */

	template<class T, class...S> inline vec<T>& RD(vec<T>& t, vec<S>&... s) { times(t.size(), i) { RD(t[i], s[i]...); } return t; }

	#define RR(typ, ...) typ __VA_ARGS__; RD(__VA_ARGS__)

	template<class T, class...A> inline T READ(A... a) { T t(a...); cin >> t; return t; }

/** container **/

	#define all(v) begin(v), end(v)

	template<class T> inline T max(const pair<T, T>& p) { return max(p.first, p.second); }

	template<class T> inline T min(const pair<T, T>& p) { return min(p.first, p.second); }

	template<class T> inline T max(const vec<T>& v) { return *max_element(all(v)); }

	template<class T> inline T min(const vec<T>& v) { return *min_element(all(v)); }

/** other **/

	#define b_max(x, y) x = max(x, y)

	#define b_min(x, y) x = min(x, y)

	inline LD AC(LD d) { return d ? d : 0; }

constexpr long INF = 1LL << 60;

constexpr long MOD = 1000000007; // 1000000009; // 998244353;



/****************************** optional library ******************************/

/* <sr.q.uf> */

	// NOT_VERIFIED

	// ref: https://github.com/monyone/teihen_library/blob/master/DataStructure/01_WeightedUnionFind.md

	struct UnionFind {

		int n;

		VI parents, treeSizes, weightDiffs;

		UnionFind(int n_) : n(n_), parents(n), treeSizes(n, 1), weightDiffs(n, 0) { times(n, i) parents[i] = i; }

		int root(int i) {

			if(parents[i] == i) return i;

			int p = root(parents[i]);

			weightDiffs[i] += weightDiffs[parents[i]];

			return parents[i] = p;

		}

		int weight(int i) { root(i); return weightDiffs[i]; }

		void merge(int i, int j, int w) { // w > 0 if i < j

			if(same(i, j)) return;

			int x = w + weight(i) - weight(j);

			i = root(i); j = root(j);

			if(treeSizes[i] < treeSizes[j]) { swap(i, j); x = -x; }

			parents[j] = i;

			treeSizes[i] += treeSizes[j]; treeSizes[j] = -1;

			weightDiffs[j] = x;

		}

		bool same(int i, int j) { return root(i) == root(j); }

		int diff(int base, int i) { return same(base, i) ? weight(i) - weight(base) : -INF; }

	};

/* <sr.q.uf> */



/************************************ main ************************************/



void settings() {

	// INPUT_GRAPH_index_sub = 0;		// uncomment if input index is 0-based

	// INPUT_GRAPH_allow_empty = true;	// uncomment to allow empty graph

	// INPUT_GRAPH_no_cost = 1;			// uncomment if all input costs are 1

}



void solve() {

	RR(int, N, M);

	UnionFind uf(N);

	times(M, i) {

		RR(int, L, R, D); --L; --R;

		if(uf.same(L, R)) {

			if(uf.diff(L, R) != D) {

				cout << "No" ln;

				return;

			}

		} else uf.merge(L, R, D);

	}

	cout << "Yes" ln;

}