#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

struct PotentialUnionFind{
    vector<int> par,rank;
    vector<long long> diff_weight;

    PotentialUnionFind(int n){
        par.resize(n);
        rank.resize(n);
        diff_weight.resize(n);
        for(int i=0;i<n;i++){
            par[i]=i;   //自身を親に設定
            rank[i]=0;
            diff_weight[i]=0;
        }
    }

    int root(int x){
        if(par[x]==x) return x;
        else{   // 経路圧縮
            int r=root(par[x]);
            diff_weight[x] += diff_weight[par[x]];
            return par[x] = r;
        }
    }

    bool same(int x,int y){ return root(x) == root(y); }

    long long weight(int x){
        root(x);    // 経路圧縮
        return diff_weight[x];
    }

    // @assert root(x) == root(y)
    // @return weight[y] - weight[x]
    long long diff(int x,int y){
        return weight(y) - weight(x);
    }

    // weight(y) - weight(x) = w となるようにmerge
    bool merge(int x,int y,long long w){
        w += weight(x);
        w -= weight(y);

        x = root(x); y = root(y);
        if(x == y) return false;

        if(rank[x] < rank[y]){
            swap(x,y);
            w = -w;
        }
        // @assert rank[x] > rank[y]

        if(rank[x] == rank[y]){
            rank[x]++;
        }
        par[y] = x;

        // xがyの親になる -> xとyの差分をdiff_weight[y]に記録
        diff_weight[y] = w;
        return true;
    }
};

int L[200005],R[200005];
ll D[200005];


int main(){
    ll N,M; scanf("%lld %lld",&N,&M);
    PotentialUnionFind puf(N);
    for(int i=0;i<M;i++){
        scanf("%d %d %lld",&L[i],&R[i],&D[i]);
        L[i]--;
        R[i]--;
        puf.merge(R[i],L[i],D[i]);
    }


    for(int i=0;i<M;i++){
        if(puf.diff(R[i],L[i]) == D[i]) continue;
        else{
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
}


Measured memory_bytes: 4992