#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
using P = pair<ll,ll>; using vp = vector<P>;
constexpr int MOD = /** 1000000007; //*/ 998244353;
/////////

// PotentialつきUnion-Find
template<class T>
struct UnionFindWithPotential{
  vector<int> par , rank;
  // pot...根に対するポテンシャル
  vector<T> pot;
  T UNIT;
  
  UnionFindWithPotential(int N , T UNIT_ = 0) : par(N) , rank(N) , pot(N) , UNIT(UNIT_){
    for(int i = 0 ; i < N ; i++) par[i] = i , rank[i] = 0 , pot[i] = UNIT;
  }

  // xの根を返す関数
  int root(int x) {
    if(par[x] == x) return x;
    int r = root(par[x]);
    pot[x] += pot[par[x]];
    return par[x] = r;
  }

  // 根に対するポテンシャルを返す関数
  T potential(int x){ root(x); return pot[x];}
  
  // 根が同じかを判定する関数
  bool same(int x,int y){return root(x) == root(y);}

  // xのyに対するpotentialを返す関数
  T diff(int x,int y){return potential(x) - potential(y);}

  // xのyに対するpotentialがpである (xはyよりもp大きい)
  // falseの時、既存の情報と矛盾
  bool merge(int x,int y,T p){
    p += potential(y) - potential(x);
    x = root(x) , y = root(y);
    if(x == y){return p == UNIT;}
    if (rank[x] > rank[y]) swap(x, y) , p = -p;
    if (rank[x] == rank[y]) ++rank[x];
    par[x] = y , pot[x] = p;
    return true;
  }

};

void solve(){
  ini(N , M);
  UnionFindWithPotential<ll> uf(N);
  rep(i , M){
    ini(L , R , D); L--; R--;
    if(uf.merge(R , L , D) == false) die("No");
  }
  trc(uf.pot);
  out("Yes");
}

Measured memory_bytes: 1792