#include <bits/stdc++.h>
using namespace std;
long long day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const long long MOD = 1000000007LL;
bool isupper(char c) {
  if ('A' <= c && c <= 'Z') return 1;
  return 0;
}
bool islower(char c) {
  if ('a' <= c && c <= 'z') return 1;
  return 0;
}
bool iskaibun(string s) {
  for (long long i = 0; i < s.size() / 2; i++)
    if (s[i] != s[s.size() - i - 1]) return 0;
  return 1;
}
bool isnumber(char c) { return ('0' <= c && c <= '9'); }
bool isalpha(char c) { return (isupper(c) || islower(c)); }
template <typename T>
void print(vector<T> v) {
  for (long long i = 0; i < v.size(); i++) {
    if (i) cout << " ";
    cout << v[i];
  }
  cout << endl;
}
long long INF = 1e18;
template <typename T>
void printendl(vector<T> v) {
  for (auto date : v) cout << date << endl;
}
template <typename T>
void printvv(vector<vector<T>> v) {
  for (long long i = 0; i < v.size(); i++) {
    for (long long j = 0; j < v[i].size(); j++) {
      if (j) cout << " ";
      cout << v[i][j];
    }
    cout << endl;
  }
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
struct Edge {
  long long to, cost;
};
struct S {
  long long time, money;
};
vector<vector<Edge>> g(10010);
long long n, m;
bool solve() {
  vector<long long> vis(n, 0), cost(n, 0);
  for (long long j = (long long)0; j < (long long)n; j++) {
    if (vis[j] == 0) {
      vis[j] = 1;
      cost[j] = 0;
      queue<long long> que;
      que.push(j);
      while (!que.empty()) {
        long long now = que.front();
        que.pop();
        for (long long i = (long long)0; i < (long long)g[now].size(); i++) {
          if (vis[g[now][i].to]) {
            if (cost[g[now][i].to] != cost[now] + g[now][i].cost) return false;
          } else {
            cost[g[now][i].to] = cost[now] + g[now][i].cost;
            vis[g[now][i].to] = 1;
            que.push(g[now][i].to);
          }
        }
      }
    }
  }
  return true;
}
signed main() {
  cin >> n >> m;
  for (long long i = (long long)0; i < (long long)m; i++) {
    long long l, r, c;
    cin >> l >> r >> c;
    l--;
    r--;
    g[l].push_back(Edge{r, c});
    g[r].push_back(Edge{l, -c});
  }
  bool ans = solve();
  if (ans)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
