#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;
}
bool isprime(long long n) {
  if (n == 1) return false;
  if (n == 2) return true;
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
struct edge {
  long long to, cost;
};
vector<vector<edge>> G(100100);
struct UnionFind {
  vector<long long> par, size;
  UnionFind(long long x) {
    par.resize(x);
    size.resize(x, 1);
    for (long long i = 0; i < x; i++) {
      par[i] = i;
    }
  }
  long long find(long long x) {
    if (par[x] == x) return x;
    return par[x] = find(par[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) {
    x = find(x);
    y = find(y);
    if (x == y) return false;
    if (size[x] < size[y]) {
      par[x] = y;
      size[y] += size[x];
    } else {
      par[y] = x;
      size[x] += size[y];
    }
    return true;
  }
};
bool bfs(long long s, long long g, long long cost) {
  long long dist[100100];
  queue<P> que;
  que.push({0, s});
  fill(dist, dist + 100100, 0);
  while (!que.empty()) {
    P p = que.front();
    que.pop();
    long long v = p.second;
    for (auto e : G[v]) {
      if (!dist[e.to]) {
        dist[e.to] = dist[v] + e.cost;
        que.push({dist[e.to], e.to});
      }
    }
  }
  if (dist[g] == cost) return true;
  return false;
}
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 (!bfs(a, b, cost)) {
        printf("No\n");
        return 0;
      }
    } else {
      uf.unite(a, b);
      G[a].push_back({b, cost});
      G[b].push_back({a, cost});
    }
  }
  printf("Yes\n");
  return 0;
}
