#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr long long inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll fact(long long i) {
  if (i == 0) return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
long long keta(ll n) {
  if (n == 0) return 1;
  long long count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) {
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
struct UnionFind {
  vector<long long> par, size, diff_weight;
  UnionFind(long long x) {
    par.resize(x);
    size.resize(x, 1);
    diff_weight.resize(x, 0);
    for (long long i = 0; i < x; i++) {
      par[i] = i;
    }
  }
  long long find(long long x) {
    if (par[x] == x) return x;
    diff_weight[x] += diff_weight[par[x]];
    return par[x] = find(par[x]);
  }
  long long weight(long long x) {
    find(x);
    return diff_weight[x];
  }
  long long diff(long long x, long long y) { return weight(y) - weight(x); }
  bool same(long long x, long long y) { return find(x) == find(y); }
  long long consize(long long x) { return size[find(x)]; }
  bool unite(long long x, long long y, long long w) {
    w += weight(x);
    w -= weight(y);
    x = find(x);
    y = find(y);
    if (x == y) return false;
    if (size[x] < size[y]) {
      swap(x, y);
      w *= -1;
    } else {
      par[y] = x;
      size[x] += size[y];
    }
    diff_weight[y] = w;
    return true;
  }
};
signed main() {
  long long n, m;
  cin >> n >> m;
  UnionFind uf(n);
  for (long long i = 0; i < (long long)(m); i++) {
    long long a, b, cost;
    cin >> a >> b >> cost;
    a--;
    b--;
    if (uf.same(a, b)) {
      if (uf.diff(a, b) != cost) {
        printf("No\n");
        return 0;
      }
    }
    uf.unite(a, b, cost);
  }
  printf("Yes\n");
  return 0;
}
