#ifdef DEBUG_IS_VALID
#define DEB 1 
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif

#include <bits/stdc++.h>
using namespace std;

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
#define fi first
#define se second
#pragma GCC optimize ("-O3")

using namespace std;

#define DUMPOUT cout
#define dump(...) if(DEB) DUMPOUT<<"  "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<"    "; if(DEB) dump_func(__VA_ARGS__)
template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;}
template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; }
template<typename T>ostream& operator << (ostream& os, set<T>& st){cout << "{"; for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;}
template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; }

void dump_func(){DUMPOUT << endl;}
template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);}
template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;}
template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;}
void solve();
int main(void) {
  std::cout << std::fixed << std::setprecision(15);
  solve();
	return 0;
}

using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<Pl>;
using vvp = vector<vp>;

const int INF = 1<<29;
const long long LINF=1LL<<59;


struct WeightedUFT{
  vector<int> par, rank, size;
  vector<long long> diff_weight;
  WeightedUFT(int N)
  : par(vector<int>(N,0)), rank(vector<int>(N,0)),
    diff_weight(vector<long long>(N, 0LL))
  {
    iota(par.begin(), par.end(), 0);
  }
  long long weight(int x){
    // weight(x) - weight(find(x))
    find(x);
    return diff_weight[x];
  }
  long long diff(int x, int y){
    return weight(x) - weight(y);
  }
  int find(int x){
    if(par[x] == x) return x;
    int r = find(par[x]);
    diff_weight[x] += diff_weight[par[x]];
    return par[x] = r;
  }
  bool unite(int x, int y, long long w){
    // unite x and y
    // s.t. weight(y) - weight(x) = w
    w += weight(x) - weight(y);
    // This w satisfies
    //     weight(find(y)) - weight(find(x)) = w
    x = find(x);
    y = find(y);
    if(x == y){
      if(w == 0) return true;
      else false; // contradiction
    }
    if(rank[x] < rank[y]) swap(x, y), w = -w;
    if(rank[x] == rank[y]) ++rank[x];
    par[y] = x;
    diff_weight[y] = w;
    return true;
  }
  bool same(int x,int y){
    return find(x) == find(y);
  }
};

void abc087_d(){
  int N, M; cin >> N >> M ;
  WeightedUFT uft(N);
  bool res = true;
  rep(i,M){
    ll l, r, d;
    cin >> l >> r >> d ;
    l--; r--;
    if(uft.same(l,r)){
      res &= (uft.diff(l,r) == d);
    }else{
      uft.unite(r,l,d);
    }
    // bool res = uft.unite(l,r,d);
    if(!res){
      cout << "No" << endl;
      return;
    }
  }
  cout << "Yes" << endl;
}

void solve(){
  abc087_d();
}

Measured memory_bytes: 1792