#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
const double eps = 1e-6;
using namespace std;
bool eq(const double &a, const double &b) { return fabs(a - b) < eps; }
bool ls(const double &a, const double &b) { return a + eps < b; }
bool le(const double &a, const double &b) { return eq(a, b) || ls(a, b); }
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); };
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long kpow(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
bool vis[maxn];
long long x[maxn];
int main() {
  memset(vis, false, sizeof(vis));
  int n, m;
  scanf("%d%d", &n, &m);
  bool ok = true;
  int l, r;
  long long k;
  for (int i = 0; i < (m); ++i) {
    scanf("%d%d%lld", &l, &r, &k);
    if (!ok) continue;
    if (vis[l] && vis[r]) {
      if (x[l] + k == x[r]) continue;
      ok = false;
    }
    if (vis[l] && !vis[r]) {
      x[r] = x[l] + k;
    }
    if (!vis[l] && vis[r]) {
      x[l] = x[r] - k;
    }
    if (!vis[l] && !vis[r]) {
      x[l] = 0;
      x[r] = k;
    }
    vis[l] = true;
    vis[r] = true;
  }
  puts(ok ? "Yes" : "No");
  return 0;
}
