// Original C++ solution (slower):
#include<bits/stdc++.h>

#include<iostream>

#include<cstdio>

#include<vector>

#include<string>

#include<algorithm>

#include<map>

using namespace std;

#define rep(i,x) for(int i = 0; i < x; i++)

#define pb push_back

#define mp make_pair

#define eb emplace_back

typedef long long ll;

typedef long double ld;

typedef pair<int,int> P;

typedef pair<ll,ll> Pll;

typedef vector<int> vi;

typedef vector<vector<int>> vvi;

typedef vector<vector<vector<int>>> vvvi;

const ll MOD = 1e9+7;

const int n_max = 1e5+10;



void print() {

    cout << endl;

}



template <class Head, class... Tail>

void print(Head&& head, Tail&&... tail) {

    cout << head;

    if (sizeof...(tail) != 0) cout << ' ';

    print(forward<Tail>(tail)...);

}



template <class T>

void print(vector<T> &vec) {

    for (auto& a : vec) {

        cout << a;

        if (&a != &vec.back()) cout << ' ';

    }

    cout << endl;

}



template <class T>

void print(vector<vector<T>> &df) {

    for (auto& vec : df) {

        print(vec);

    }

}



template<typename T>

void print(T &arr){

    ll sz = sizeof(arr)/sizeof(arr[0]);

    for(int i = 0;i < sz-1;i++){cout << arr[i] << ' ';}

    cout << arr[sz-1] << endl;

}



ll n = 1e5+10,m = 2e5+10;

ll INF = INT_MAX;

vector<ll> place(n,INF);

// bool ok = true;

vector<vector<Pll>> graph(n);

// template<class T>

bool dfs(int now, int pre = -1){

    bool ok = true;

    // is_move[now] = 1;

    for(auto i : graph[now]){

        int to = i.first;

        ll dis = i.second;

        if(to == pre)continue;

        if(place[to] == INF){

            place[to] = place[now] + dis;

            ok &= dfs(to, now);

        }

        else{

            if(place[to] != place[now] + dis){

                ok = false;

                break;

            }

        }

    }

    return ok;

}



int main(){

    cin >> n >> m;

    // vector<ll> l(m), r(m), d(m);

    // vector<vector<Pll>> graph(n);

    set<ll> st;

    rep(i,m){

        ll l,r,d;cin >> l >> r >> d;

        l--;r--;

        st.insert(l);

        st.insert(r);

        graph[l].emplace_back(Pll(r,d));

        graph[r].emplace_back(Pll(l,-d));

    }

    bool res = true;



    // clock_t start = clock();



    for(auto i : st){

        // if(graph[i].size() == 0)continue;

        // print(i,is_move[i],place[i]);

        if(place[i] == INF){

            place[i] = 0;

            res &= dfs(i);

        }

        if(!res)break;

    }



    // clock_t end = clock();



    // const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;

    // printf("time %lf[ms]\n", time);

    cout << (res ? "Yes" : "No") << endl;

}

// Optimized solution to the same problem (faster):
#ifdef LOCAL

#define _GLIBCXX_DEBUG

#endif

#include<bits/stdc++.h>

using namespace std;

#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)

#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)

#define all(x) (x).begin(), (x).end()

typedef long long ll;

typedef long double ld;

typedef pair<ll,ll> Pll;

typedef vector<ll> vl;

typedef vector<vl> vvl;

typedef vector<vvl> vvvl;

constexpr ll INF = numeric_limits<ll>::max()/4;

constexpr ll n_max = 2e5+10;

#define int ll



template <typename A, typename B>

string to_string(pair<A, B> p);

string to_string(const string &s) {return '"' + s + '"';}

string to_string(const char *c) {return to_string((string) c);}

string to_string(bool b) {return (b ? "true" : "false");}

template <size_t N>

string to_string(bitset<N> v){

    string res = "";

    for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);

    return res;

}

template <typename A>

string to_string(A v) {

    bool first = true;

    string res = "{";

    for(const auto &x : v) {

        if(!first) res += ", ";

        first = false;

        res += to_string(x);

    }

    res += "}";

    return res;

}

template <typename A, typename B>

string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}



void debug_out() {cerr << endl;}

template<typename Head, typename... Tail>

void debug_out(Head H, Tail... T) {

    cerr << " " << to_string(H);

    debug_out(T...);

}



#ifdef LOCAL

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

#else

#define debug(...) 42

#endif



template<class T>

bool chmax(T &a, T b){if(a < b){a = b; return true;} return false;}

template<class T>

bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;}





template< typename T>

struct UnionFind{

private:

    vector<T> par;

    vector<T> rank;

    vector<T> sz;

    int n;



public:

    //n要素で親を初期化、par[x]はxの親を表す

    UnionFind(int n): n(n) {

        par.resize(n,0);

        rank.resize(n,0);

        sz.resize(n,1);

        for(int i = 0; i < n; i++){

            par[i] = i;

        }

    }



    //木の根を求める

    int root(int x){

        if(par[x] == x) return x;

        else return par[x] = root(par[x]);

    }



    //xとyの属する集合を併合

    void unite(int x, int y){

        x = root(x);

        y = root(y);

        if(x == y) return;

        

        if(rank[x] < rank[y]){

            swap(x,y);

        }

        

        par[y] = x;

        sz[x] += sz[y];

        if(rank[x] == rank[y]) rank[x]++; 

    }



    //xとyが同じ集合に属するか否か

    bool same(int x, int y){

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

    }



    //xが属する集合のサイズを返す

    int size(int x){

        return sz[root(x)];

    }



    // 集合の数を返す

    int num_of_s(){

        vector<int> cnt(n);

        int ans = 0;

        for(int i = 0; i < n;i++){

            if(!cnt[root(i)])ans++, cnt[root(i)] = 1;

        }

        return ans;

    }

};



template<class Abel>

struct WeightedUnionFind{

    vector<int> par;

    vector<int> rank;

    vector<Abel> diff_weight;

    int n;

    Abel M0;



    WeightedUnionFind(int n, Abel M0 = 0):n(n), M0(M0){

        init(n, M0);

    }



    void init(int n, Abel M0 = 0){

        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] = M0;

        }

    }



    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;

        }

    }



    Abel weight(int x){

        root(x);

        return diff_weight[x];

    }



    // w(x) + w == w(y)となるように併合

    bool unite(int x, int y, Abel &w){

        w += weight(x) - weight(y);

        x = root(x);

        y = root(y);

        if(x == y) return w == 0;



        if(rank[x] < rank[y]){

            swap(x, y);

            w = -w;

        }



        par[y] = x;

        diff_weight[y] = w;

        if(rank[x] == rank[y])rank[x]++;

        return true;

    }



    bool same(int x, int y){

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

    }





    Abel diff(int x, int y){

        return weight(y) - weight(x);

    }

};



signed main(){

    int n,m; cin >> n >> m;

    WeightedUnionFind<ll> uf(n);

    for(int i = 0; i < m; i++){

        ll l,r; cin >> l >> r;

        ll w; cin >> w;

        l--;r--;

        if(!uf.unite(l, r, w)){

            cout << "No" << "\n";

            return 0;

        }

    }

    cout << "Yes" << "\n";

}

// Fastest known solution for this problem: