#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long getnum() {
  char c = getchar();
  long long num, sign = 1;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') sign = -1;
  for (num = 0; c >= '0' && c <= '9';) {
    c -= '0';
    num = num * 10 + c;
    c = getchar();
  }
  return num * sign;
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (0); i < (b); i++) {
    multiply *= a;
  }
  return multiply;
}
int n, m, l, r, d, pos[2 * 100002];
vector<pair<int, int> > onleft[2 * 100002], onright[2 * 100002];
bool possible = true, in[2 * 100002];
void dfs(int u) {
  for (auto it : onright[u]) {
    int v = it.first, c = it.second;
    if (pos[v] == -1)
      pos[v] = pos[u] + c;
    else {
      if (pos[v] != pos[u] + c) {
        possible = false;
        return;
      }
    }
    dfs(v);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  int test, cases = 1;
  cin >> n >> m;
  for (int i = (0); i < (m); i++) {
    cin >> l >> r >> d;
    in[l] = true;
    in[r] = true;
    onright[l].push_back({r, d});
    onleft[r].push_back({l, d});
  }
  memset(pos, -1, sizeof(pos));
  for (int i = (1); i < (n + 1); i++) {
    if (onright[i].size() == 0) continue;
    if (onleft[i].size() == 0) {
      pos[i] = 0;
      dfs(i);
      if (!possible) break;
    }
  }
  for (int i = (1); i < (n + 1); i++) {
    if (in[i] && pos[i] == -1) possible = false;
  }
  possible ? puts("Yes") : puts("No");
  return 0;
}
