#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
using namespace std;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }
template<class itr> void cins(itr first,itr last){
    for (auto i = first;i != last;i++){
        cin >> (*i);
    }
}
template<class itr> void array_output(itr start,itr goal){
    string ans = "",k = " ";
    for (auto i = start;i != goal;i++) ans += to_string(*i)+k;
    if (!ans.empty()) ans.pop_back();
    PRINT(ans);
}
ll gcd(ll a, ll b) {
    return a ? gcd(b%a,a) : b;
}
const ll INF = 1e18;
const ll MOD = 1000000007;
typedef pair<ll,ll> P;
const ll MAX = 20000;
constexpr ll nx[8] = {1,0,-1,0,-1,-1,1,1};
constexpr ll ny[8] = {0,1,0,-1,-1,1,-1,1};
template<class Abel> class WeightedUnionFind {
    private:
        vector<ll> par;
        vector<ll> rank;
        vector<Abel> diff_weight;
    public:
        WeightedUnionFind(ll n = 1, Abel SUM_UNITY = 0) {
            init(n, SUM_UNITY);
        }

        void init(ll n = 1, Abel SUM_UNITY = 0) {
            par.resize(n); rank.resize(n); diff_weight.resize(n);
            for (ll i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY;
        }

        ll root(ll x) {
            if (par[x] == x) {
                return x;
            }
            else {
                ll r = root(par[x]);
                diff_weight[x] += diff_weight[par[x]];
                return par[x] = r;
            }
        }

        Abel weight(ll x) {
            root(x);
            return diff_weight[x];
        }

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

        bool unite(ll x, ll y, Abel 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;
            if (rank[x] == rank[y]) ++rank[x];
            par[y] = x;
            diff_weight[y] = w;
            return true;
        }

        Abel diff(ll x, ll y) {
            return weight(y) - weight(x);
        }
};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,m,l,r,d;
    cin >> n >> m;
    WeightedUnionFind<int> g(n);
    bool ok = 1;
    rep(i,m){
        cin >> l >> r >> d;
        --l;
        --r;
        if (g.same(l,r)){
            if(g.diff(l,r) != d) ok = 0;
        }
        else{
            g.unite(l,r,d);
        }
    }
    Yes(ok);
}

Measured memory_bytes: 2176