#include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, s, n) for (i64 i = (s), i##_limit = (n); i < i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#define var(type, ...) \
    type __VA_ARGS__;  \
    read(__VA_ARGS__);
#ifndef DBG
#define dump(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U>
inline bool chmax(T &a, const U &b) {
    return b > a && (a = b, true);
}
template <class T, class U>
inline bool chmin(T &a, const U &b) {
    return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;

template <class T>
inline vector<T> makeV(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeV(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeV<T>(initValue, args...))>(
        sz, makeV<T>(initValue, args...));
}

template <class T>
inline istream &operator>>(istream &is, vector<T> &vec) {
    for (auto &e : vec) is >> e;
    return is;
}

inline void read() {}

template <class Head, class... Tail>
inline void read(Head &head, Tail &... tail) {
    cin >> head;
    read(tail...);
}

inline void print() { cout << "\n"; }

template <class Head, class... Tail>
inline void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << ' ';
    print(forward<Tail>(tail)...);
}

template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e : vec) os << e << delim[&e == &vec.back()];
    return os;
}

template <class Container>
struct Rev {
    Container &x_;
    inline Rev(Container &x) : x_(x) {}
    inline auto begin() { return rbegin(x_); }
    inline auto end() { return rend(x_); }
};
// }}} End Header

template <class Abel>
struct WeightedUnionFind {
    vector<int> p;    // 親もしくは連結成分の数
    vector<Abel> dw;  // 親ノードとの差分

    explicit WeightedUnionFind(int n, Abel SUM_UNITY = 0)
        : p(n + 5, -1), dw(n + 5, SUM_UNITY) {}

    inline int root(int x) {
        if (p[x] < 0) {
            return x;
        } else {
            const int r = root(p[x]);
            return (dw[x] += dw[p[x]]), (p[x] = r);
        }
    }

    // diff(x, y) == w となるようにする
    inline bool unite(int x, int y, Abel w) {
        w += weight(x);
        w -= weight(y);
        if ((x = root(x)) == (y = root(y))) return false;
        p[x] += p[y];
        p[y] = x;
        dw[y] = w;
        return true;
    }

    inline bool same(int x, int y) { return root(x) == root(y); }
    inline int size(int x) { return -p[root(x)]; }
    inline Abel diff(int x, int y) { return weight(y) - weight(x); }
    inline Abel weight(int x) {
        root(x);
        return dw[x];
    }
};

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    var(int, N, M);
    WeightedUnionFind<i64> uf(N);

    bool ok = true;
    rep(i, 0, M) {
        var(int, l, r, d);
        --l, --r;
        uf.unite(l, r, d);
        ok &= uf.diff(l, r) == d;
    }

    print((ok) ? "Yes" : "No");

    return 0;
}


Measured memory_bytes: 1408