#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

struct UnionFind {
  vi32 par;
  vi32 siz;
  UnionFind(int n) {
    par = vi32(n);
    siz = vi32(n, 1);
    iota(all(par), 0);
  }
  int root(int x) {
    if (par[x] == x) return x;
    return par[x] = root(par[x]);
  }
  void unite(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y) return;
    par[x] = y;
    siz[y] += siz[x];
  }
  bool same(int x, int y) {
    return root(x) == root(y);
  }
  int size(int x) {
    return siz[root(x)];
  }
};

void solve() {
  int N, M; cin >> N >> M;
  auto uf = UnionFind(N + 1);
  unordered_map<int, unordered_map<int, int>> ma;

  rep(i, M) {
    int l, r, d; cin >> l >> r >> d;
    if (uf.same(l, r)) {
      int root = uf.root(l);
      int dist = ma[root][r] - ma[root][l];
      if (d != dist) no();
    } else {
      int lroot = uf.root(l);
      int rroot = uf.root(r);
      int lsize = uf.size(l);
      int rsize = uf.size(r);

      if (lsize < rsize) {
        uf.unite(l, r);
      } else {
        uf.unite(r, l);
      }

      if (ma.count(lroot) == 0) {
        ma[lroot][l] = 0;
      }
      if (ma.count(rroot) == 0) {
        ma[rroot][r] = 0;
      }

      if (lsize < rsize) {
        int dist = ma[lroot][l] + d - ma[rroot][r];
        each(m, ma[lroot]) m.second -= dist;
        ma[rroot].insert(all(ma[lroot]));
      } else {
        int dist = ma[lroot][l] + d - ma[rroot][r];
        each(m, ma[rroot]) m.second += dist;
        ma[lroot].insert(all(ma[rroot]));
      }
    }
  }

  yes();
}


Measured memory_bytes: 40868