#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

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

template <class Container, class Value = typename Container::value_type,
         enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
 inline istream& operator>>(istream &is, Container &vs) {
     for (auto &v: vs) is >> v;
     return is;
 }

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << " ";
    output(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
         enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
 inline ostream& operator<<(ostream &os, const Container &vs) {
     static constexpr const char *delim[] = {" ", ""};
     for (auto it = begin(vs); it != end(vs); ++it) {
         os << delim[it == begin(vs)] << *it;
     }
     return os;
 }

template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = " ", const string &last = "\n") {
    for (auto it = Begin; it != End; ++it) {
        cout << ((it == Begin) ? "" : delim) << *it;
    }
    cout << last;
}

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

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

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}

void ioinit() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    clog << fixed << setprecision(10);
}
// }}} End Header

// WeightedUnionFind {{{
template <class Abel>
struct WeightedUnionFind {
    mutable vector<int> c;
    mutable vector<Abel> diff_weight;

    explicit WeightedUnionFind(const size_t n, Abel SUM_UNITY = 0) :
        c(n + 1, -1), diff_weight(n + 1, SUM_UNITY)
    {}

    size_t size(size_t v) const {
        return -c[root(v)];
    }

    size_t root(size_t v) const {
        if (c[v] < 0) {
            return v;
        } else {
            const size_t r = root(c[v]);
            diff_weight[v] += diff_weight[c[v]];
            return c[v] = r;
        }
    }

    Abel weight(size_t v) const {
        root(v);
        return diff_weight[v];
    }

    Abel diff(size_t u, size_t v) const {
        return weight(v) - weight(u);
    }

    bool connected(size_t u, size_t v) const {
        return root(u) == root(v);
    }

    // weight(v) = weight(u) + w
    bool unite(size_t u, size_t v, Abel w) {
        w += weight(u);
        w -= weight(v);
        u = root(u);
        v = root(v);
        if (u == v) return false;
        if (-c[u] > -c[v]) swap(u, v), w = -w;
        c[u] += c[v];
        c[v] = u;
        diff_weight[v] = w;
        return true;
    }
};
// }}}

signed main() {
    ioinit();

    var(size_t, N, M);

    WeightedUnionFind<intmax_t> wuf(N);
    bool valid = true;
    while (M--) {
        var(size_t, L, R);
        var(intmax_t, D);
        L--, R--;
        if (wuf.connected(L, R)) {
            dump(wuf.diff(L, R));
            if (wuf.diff(L, R) != D) valid = false;
        } else {
            wuf.unite(L, R, D);
        }
    }

    cout << ((valid) ? "Yes" : "No") << "\n";
    return 0;
}


Measured memory_bytes: 4496