#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr int INF = 2000000000;
constexpr int HINF = INF / 2;
constexpr double DINF = 100000000000000000.0;
constexpr long long LINF = 9223372036854775807;
constexpr long long HLINF = 4500000000000000000;
constexpr long long MMOD = 500000004;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
vector<pair<int, LL>> G[101010];
LL l[202020], r[202020], d[202020];
bool used[101010];
LL pos[101010];
int n, m;
bool serch(int p) {
  queue<int> q;
  q.push(p);
  while (!q.empty()) {
    int Pos = q.front();
    q.pop();
    used[Pos] = true;
    for (int i = (0); i < (G[Pos].size()); i++) {
      if (!used[G[Pos][i].first]) {
        q.push(G[Pos][i].first);
        pos[G[Pos][i].first] = pos[Pos] + G[Pos][i].second;
      } else {
        if (pos[Pos] + G[Pos][i].second != pos[G[Pos][i].first]) return false;
      }
    }
  }
  return true;
}
int main() {
  cin >> n >> m;
  int first;
  for (int i = (0); i < (m); i++) {
    cin >> l[i] >> r[i] >> d[i];
    l[i]--, r[i]--;
    if (!i) first = l[i];
    G[r[i]].emplace_back(make_pair(l[i], d[i]));
    G[l[i]].emplace_back(make_pair(r[i], -d[i]));
  }
  for (int i = (0); i < (n); i++) pos[i] = LINF;
  for (int i = (0); i < (n); i++) {
    if (!used[i]) {
      pos[i] = 0;
      if (serch(i) == false) {
        cout << "No" << endl;
        return 0;
      }
    }
  }
  cout << "Yes" << endl;
}
