#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#include <numeric>
#define IINF 1000000000
#define INF 9223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) fo-r (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
//#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,ll> a,pair<ll,ll> b){
        if(a.se!=b.se)
        return a.se<b.se;
        else
        return a.fi>b.fi;
}
//----------------------------------------------------------------------
V<Pll>G1[100010];
V<Pll>G2[100010];
//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_t=clock();
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    //------------------------------
    ll n,m;cin>>n>>m;
    V<ll>L(m),R(m),D(m);
    V<ll>x(n+1);
    for(ll i=1;i<=n;i++)x[i]=-INF;
    map<ll,ll>M;
    for(ll i=0;i<m;i++){
        cin>>L[i]>>R[i]>>D[i];
        M[R[i]]++;
        G1[L[i]].pb(mp(R[i],D[i]));
        G2[R[i]].pb(mp(L[i],D[i]));
    }
    ll nos = 0;
    for(ll i=1;i<=n;i++){
        if(x[i]!=-INF)continue;
        if(M[i]==0){
            x[i]=nos;
            queue<ll>Q;
            Q.push(i);
            while(!Q.empty()){
                ll p = Q.front();Q.pop();
                for(ll j=0;j<G1[p].size();j++){
                    if(x[G1[p][j].fi]!=-INF)continue;
                    ll d = G1[p][j].se;
                    x[G1[p][j].fi] = x[p]+d;
                    Q.push(G1[p][j].fi);
                }
                for(ll j=0;j<G2[p].size();j++){
                    if(x[G2[p][j].fi]!=-INF)continue;
                    ll d = G2[p][j].se;
                    x[G2[p][j].fi] = x[p]-d;
                    Q.push(G2[p][j].fi);
                }
            }

            nos+=11000;
        }
    }

    bool abc=1;
    for(ll i=0;i<m;i++){
        if(D[i]!=x[R[i]]-x[L[i]]){
            abc=0;
            break;
        }
    }
    if(abc==0)cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    //------------------------------
    //fclose(stdin);
    //fclose(stdout);
    //ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------








































Measured memory_bytes: 30044