#include <bits/stdc++.h>
const int N = 505;
const int LG = 21;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
using namespace std;
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
long long inq(long long x, long long y) {
  if (!y) return 1 % MOD;
  long long l = inq(x, y / 2);
  if (y % 2) return l * l % MOD * x % MOD;
  return l * l % MOD;
}
long long rev(long long x) { return inq(x, MOD - 2); }
bool __precomputed_combinatorics = 0;
vector<long long> __fact, __ufact, __rev;
void __precompute_combinatorics() {
  __precomputed_combinatorics = 1;
  __fact.resize(N);
  __ufact.resize(N);
  __rev.resize(N);
  __rev[1] = 1;
  for (int i = 2; i < N; i++) __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
  __fact[0] = 1, __ufact[0] = 1;
  for (int i = 1; i < N; i++)
    __fact[i] = __fact[i - 1] * i % MOD,
    __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
long long fact(int x) {
  if (!__precomputed_combinatorics) __precompute_combinatorics();
  return __fact[x];
}
long long cnk(int n, int k) {
  if (!__precomputed_combinatorics) __precompute_combinatorics();
  return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
void __fast_IO() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
int n, m;
long long dist[N], root[N];
vector<int> sub[N];
int Root(int x) {
  if (x == root[x]) return x;
  return Root(root[x]);
}
signed main() {
  __fast_IO();
  cin >> n >> m;
  for (int i = 0; i < n; i++) root[i] = i, sub[i] = {i};
  for (int i = 0; i < m; i++) {
    int a, b, w;
    cin >> a >> b >> w;
    a--, b--;
    int x = Root(a), y = Root(b);
    if (x == y) {
      if (dist[b] - dist[a] != w) {
        cout << "No";
        return 0;
      }
      continue;
    }
    if (sub[x].size() < sub[y].size()) {
      dist[x] = -dist[a] - w + dist[b];
      for (auto e : sub[x]) {
        sub[y].push_back(e);
        root[e] = y;
        if (e != x) dist[e] += dist[x];
      }
    } else {
      dist[y] = dist[a] + w - dist[b];
      for (auto e : sub[y]) {
        sub[x].push_back(e);
        root[e] = x;
        if (e != y) dist[e] += dist[y];
      }
    }
  }
  cout << "Yes";
}
