#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 edge {
  long long to, cost;
};
vector<vector<edge>> G(100100);
vector<long long> dist(100100, inf);
bool bfs(long long s) {
  queue<P> que;
  que.push({0, s});
  dist[s] = 0;
  while (!que.empty()) {
    P p = que.front();
    que.pop();
    long long v = p.second;
    for (auto e : G[v]) {
      if (dist[e.to] != inf && dist[e.to] != dist[v] + e.cost) {
        return true;
      }
      if (dist[e.to] == inf) {
        dist[e.to] = dist[v] + e.cost;
        que.push({dist[e.to], e.to});
      }
    }
  }
  return false;
}
signed main() {
  long long n, m;
  cin >> n >> m;
  if (m == 0) {
    printf("Yes\n");
    return 0;
  }
  long long k;
  for (long long i = 0; i < (long long)(m); i++) {
    long long a, b, cost;
    cin >> a >> b >> cost;
    a--;
    b--;
    k = a;
    G[a].push_back({b, cost});
    G[b].push_back({a, -cost});
  }
  if (bfs(k))
    printf("No\n");
  else
    printf("Yes\n");
  return 0;
}
