#include <iostream>
#include <cstdio>
#include <vector>
#include <functional>
#include <string>
#include <map>
using namespace std;

//===
//#include <vector>
//#include <functional>
template<typename Abel>
struct WeightedUnionFind {
    using OP = function<Abel(Abel, Abel)>;

    vector<int> parent;
    vector<Abel> diff_weight; //親からの距離
    const OP add;
    const OP sub;
    const Abel e;
    
    WeightedUnionFind(){};

    WeightedUnionFind(int nmemb,
                      const Abel &e = 0,
                      const OP &add = [](Abel x, Abel y){return x+y;},
                      const OP &sub = [](Abel x, Abel y){return x-y;}):
        add(add),
        sub(sub),
        e(e)
    {
        parent.assign(nmemb, -1);
        diff_weight.assign(nmemb, e);
    }

    int root(int x) {
        if (parent[x] < 0) {
            return x;
        }
        
        int p = root(parent[x]);
        diff_weight[x] = add(diff_weight[x], diff_weight[parent[x]]);
        parent[x] = p;

        return p;
    }

    bool same(int x, int y) { return root(x) == root(y); }
    
    bool unite(int x, int y, Abel w) {
        Abel wx = weight(x);
        Abel wy = weight(y);

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

        if (x == y) return false;

        w = sub(add(w, wx), wy);

        parent[x] += parent[y];
        parent[y] = x;
        diff_weight[y] = w;
        
        return true;
    }
    
    Abel weight(int x) {
        root(x);
        return diff_weight[x];
    }

    Abel diff(int x, int y) { return sub(weight(y), weight(x)); }

    int size(int x) { return -parent[root(x)]; }
};
//===

typedef long long ll;

// verify AtCoder Beginner Contest 087 D
// https://atcoder.jp/contests/abc087/submissions/6393566
int abc087D(void)
{
    WeightedUnionFind<ll> uf(1000005);
    ll n, m;
    ll l, r, d;

    cin >> n >> m;

    for (int i = 0; i < m; i++) {
        cin >> l >> r >> d;

        uf.unite(l, r, d);

        if (uf.diff(l, r) != d) {
            cout << "No" << endl;
            return 0;
        }
    }

    cout << "Yes" << endl;

    return 0;
}

// verify AOJ_DSL_1_B
// https://onlinejudge.u-aizu.ac.jp/solutions/problem/DSL_1_B/review/3750268/ei1710/C++14
int AOJ_DSL1B(void)
{
    int n, q;
    ll com, x, y, w;

    cin >> n >> q;
    
    WeightedUnionFind<ll> uf(n);

    while (q--) {
        cin >> com;

        if (com == 0) {
            cin >> x >> y >> w;
            uf.unite(x, y, w);
        }
        else {
            cin >> x >> y;
            if (uf.same(x, y)) {
                cout << uf.diff(x, y) << endl;
            }
            else {
                cout << '?' << endl;
            }
        }
    }

    return 0;
}

// verify UTPC2010 D
// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2207/review/3750413/ei1710/C++14
int UTPC2010D(void)
{
    int n;
    while (cin >> n, n != 0) {
        map<string, int> mp;
        string s, t;
        int id = 1;
        ll cost;
        WeightedUnionFind<ll> uf(n * 2 + 5);
        bool f = true;

        for (int i = 0; i < n; i++) {
            scanf("%*d"); // '1'
            cin >> s; //
            scanf(" %*c "); // '='
            scanf("10^ %lld", &cost);
            cin >> t;

            if (mp.count(s) == 0) {
                mp[s] = id++;
            }
            if (mp.count(t) == 0) {
                mp[t] = id++;
            }

            uf.unite(mp[s], mp[t], cost);

            if (uf.diff(mp[s], mp[t]) != cost) {
                f = false;
            }
        }

        if (f) {
            cout << "Yes" << endl;
        }
        else {
            cout << "No" << endl;
        }
    }

    return 0;
}

int main()
{
    return abc087D();
    //return AOJ_DSL1B();
    //return UTPC2010D();
}


Measured memory_bytes: 12032