#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <utility>
#include <functional>
#include <iomanip>
#include <typeinfo>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <tuple>
#include <map>
#include <set>
#include <numeric>
using namespace std;

#define all(container) container.begin(), container.end()
#define sortall(container) (sort(container.begin(), container.end()))
#define yn(cond) ((cond) ? (cout << "Yes" << endl) : (cout << "No" << endl))
#define YN(cond) ((cond) ? (cout << "YES" << endl) : (cout << "NO" << endl))
#define LLONG_MAX numeric_limits<long long>::max()
#define INT_MAX numeric_limits<int>::max()

typedef long long       ll;
typedef vector<int>     vi;
typedef vector<ll>      vll;
typedef vector<double>  vd;
typedef vector<bool>    vb;
typedef vector<string>  vs;
typedef vector<char>    vc;
typedef pair<int, int>  pii;
typedef pair<ll, ll>    pll;
typedef vector<pii>     vpii;
typedef vector<pll>     vpll;
typedef vector<vll>		vvll;
typedef vector<vi>		vvi;
typedef vector<vb>		vvb;
typedef vector<vs>		vvs;
typedef vector<vc>		vvc;

typedef struct edge_ {
	ll to;
	ll cost;
} edge;

typedef struct point_ {
	ll x, y;
	point_(ll x = 0, ll y = 0) : x(x), y(y) {}
} point;

template <typename T>
using mat2d = vector<vector<T>>;

constexpr double	PI = 3.14159265358979323846;
constexpr ll		INF = 1 << 15;
constexpr ll		MOD = (ll)1e9 + 7;
constexpr double	EPS = 1e-7;
constexpr int		dy4[4] = { 0, 1, 0, -1 };
constexpr int		dx4[4] = { 1, 0, -1, 0 };
constexpr int		dy8[8] = { 0, 1, 1, 1, 0, -1, -1, -1 };
constexpr int		dx8[8] = { 1, 1, 0, -1, -1, -1, 0, 1 };

template<typename T>
istream& operator >> (istream& is, vector<T>& vec) {
	for (T& x : vec) is >> x;
	return is;
}

template<typename T>
ostream& operator << (ostream& os, const vector<T>& vec) {
	for (const T& x : vec) os << x << " ";
	return os;
}

template<typename S, typename T>
istream& operator >> (istream& is, pair<S, T>& p) {
	is >> p.first >> p.second;
	return is;
}

istream& operator >> (istream& is, point& p) {
	is >> p.x >> p.y;
	return is;
}

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

ostream& operator << (ostream& os, const edge e) {
	os << "{to: " << e.to << ", cost: " << e.cost << "}";
	return os;
}

ostream& operator << (ostream& os, const point& p) {
	os << "(" << p.x << " " << p.y << ")";
	return os;
}

/******************************************************************************/
/**********************         Don't make WA !!         **********************/
/******************************************************************************/

int main()
{
	ll N, M;
	cin >> N >> M;
	vll L, R, D;
	L = R = D = vll(M);
	for (int i = 0; i < M; i++)
		cin >> L[i] >> R[i] >> D[i];

	if (M == 0) {
		cout << "Yes" << endl;
		return 0;
	}

	vector<vector<edge>> G(N + 1);
	for (int i = 0; i < M; i++) {
		edge e;
		e.cost = D[i];
		e.to = R[i];
		G[L[i]].push_back(e);
		e.cost = -D[i];
		e.to = L[i];
		G[R[i]].push_back(e);
	}

	vector<pair<ll, bool>> pos(N + 1, make_pair(0, false));

	queue<int> q;
	q.push(L[0]);
	pos[L[0]].first = 0;
	pos[L[0]].second = true;

	while (true) {
		while (!q.empty()) {
			int curr = q.front();
			q.pop();

			for (auto g : G[curr]) {
				int next = g.to;
				int cost = g.cost;

				if (!pos[next].second) {
					pos[next].first = pos[curr].first + cost;
					pos[next].second = true;
					q.push(next);
				}
				else if (pos[next].first != pos[curr].first + cost) {
					cout << "No" << endl;
					return 0;
				}
			}
		}

		for (int i = 0; i < M; i++) {
			if (!pos[L[i]].second) {
				q.push(L[i]);
				pos[L[i]].second = true;
				break;
			}

			if (!pos[R[i]].second) {
				q.push(R[i]);
				pos[R[i]].second = true;
				break;
			}
		}

		if (q.empty())
			break;
	}

	cout << "Yes" << endl;

	return 0;
}

Measured memory_bytes: 19328