#include <bits/stdc++.h>
using namespace std;

/***** type *****/
using ll = long long;
using ld = long double;
template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;
template <class T> using vvvt = vector<vector<vector<T>>>;
template <class T> using uset = unordered_set<T>;
template <class T1, class T2> using umap = unordered_map<T1, T2>;

/***** define *****/
#define all(c) (c).begin(), (c).end()            // begin to end
#define coutld cout << fixed << setprecision(10) // cout long double
#define rep(i, b, e) for (ll i = b; i < e; i++)  // repeat
#define repr(i, b, e) for (ll i = b; e < i; i--) // repeat reverse
#define pair NyaaPair                            // nyaa pair
#define first f                                  // pair::first
#define second s                                 // pair::second
/***** const value *****/
#define llong_max 9223372036854775807            // 9 * 10^18
#define ldbl_max 1.79769e+308                    // 1.7 * 10^308
#define pi 3.1415926535897932                    // 3.14 ...
#define loop_end 9223372036854775806             // LLONG_MAX-1
/***** for each macro *****/
#define fori(i, ...) if(ll i = -1) for(__VA_ARGS__) if(i++, true)
#define each(i, e, c) fori(i, auto& e: c)
#define forir(i, v, ...) if(ll i=(ll)v.size())for(__VA_ARGS__)if(i--,true)
#define eachr(i, e, c) forir(i, auto e = c.rbegin(); e != c.rend(); ++e)

/***** lambda *****/
auto Count = [] // long long count value
(auto b, auto e, auto x) { return (ll)count(b, e, x); };
auto CtoN = [] // char to number
(auto c) { return (ll)(c - '0'); };
auto CeilD = [] // long double ceiling div
(auto a, auto b) { return ceil((ld)a / (ld)b); };
auto Fix = [] // fix value
(auto b, auto e, auto fix)
{ for (auto it = b; it != e; ++it) *it += fix; };
auto NtoC = [] // number to char
(auto n) { return (char)('0' + n); };
auto Pow = [] // long long pow
(auto a, auto b) { return (ll)pow(a, b); };
auto Pow2 = [] // long long pow2
(auto n) { return (1LL << n); };
auto Pow10 = [] // long long pow10
(auto n) { return (ll)pow(10, n); };
auto Size = []  // long long collection size
(auto& c) { return (ll)(c).size(); };
auto Sum = [] // long long accumulate
(auto b, auto e) { return accumulate(b, e, 0LL); };

/***** template *****/
template <class T> void MakeVVT
(ll ys, ll xs, vvt<T>& v, T fill = T())
{	// vector<vector<T>> resize + fill
	v.resize(ys); rep(y, 0, ys) v[y].resize(xs, fill);
}
template <class T> void MakeVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fill = T())
{	// vector<vector<vector<T>>> resize + fill
	v.resize(zs); rep(z, 0, zs) MakeVVT(ys, xs, v[z], fill);
}
template <class T> void InputVT
(ll xs, vt<T>& v, T fix = T())
{	// input vector<T> (T != struct) + fix
	v.resize(xs); rep(i, 0, xs) { cin >> v[i]; v[i] += fix; }
}
template <class T> void InputVVT
(ll ys, ll xs, vvt<T>& v, T fix = T())
{	// input vector<vector<T>> (T != struct) + fix
	MakeVVT(ys, xs, v, fix);
	rep(y, 0, ys) rep(x, 0, xs) { cin >> v[y][x]; v[y][x] += fix; }
}
template <class T> void InputVVVT
(ll zs, ll ys, ll xs, vvvt<T>& v, T fix = T())
{	// input vector<vector<vector<T>>> (T != struct) + fix
	v.resize(zs); rep(z, 0, zs) InputVVT(ys, xs, v[z], fix);
}
template <class T1, class T2> struct NyaaPair
{	// nyaa pair template
	T1 f; T2 s;
};
template <class T1, class T2> bool operator <
(const NyaaPair<T1, T2>& l, const NyaaPair<T1, T2>& r)
{	// nyaa pair template operator <
	return (l.f != r.f) ? l.f < r.f : l.s < r.s;
}
template <class T1, class T2> bool operator >
(const NyaaPair<T1, T2>& l, const NyaaPair<T1, T2>& r)
{	// nyaa pair template operator >
	return (l.f != r.f) ? l.f > r.f : l.s > r.s;
}

/**************************************/
/********** BEGIN OF NYA LIB **********/
/**************************************/

namespace NyaGadget {}

namespace NyaGadget
{
	/*** 重み付きUnionFindライブラリ ***/

    template <class T> struct DS_WeightUnionFind
    {
        vector<long long> root;  // 根の頂点
        vector<long long> tsize; // 木のサイズ
        vector<T> weight;        // 重み

        DS_WeightUnionFind(long long n)
        {
            root.resize(n);
            tsize.resize(n);
            weight.resize(n);
            for (long long i = 0; i < n; i++)
            {
                root[i] = i;
                tsize[i] = 1;
                weight[i] = 0;
            }
        }

        T Diff(long long x, long long y)
        {
            return Weight(y) - Weight(x);
        }

        long long Find(long long x)
        {
            if (root[x] == x) return x;

            long long r = Find(root[x]);
            weight[x] += weight[root[x]];
            return root[x] = r;
        }

        bool Same(long long x, long long y)
        {
            return Find(x) == Find(y);
        }

        T Weight(long long x)
        {
            Find(x);
            return weight[x];
        }

        bool Union(long long x, long long y, T w)
        {
            long long rx = Find(x);
            long long ry = Find(y);

            // 既に同じ木に属しているときは何もしない
            if (rx == ry) return false;

            // サイズの小さい木の根をサイズの大きい木の根に繋いで併合する
            w += Weight(x); w -= Weight(y);
            if (tsize[rx] < tsize[ry])
            {
                root[rx] = ry;
                tsize[ry] += tsize[rx];
                weight[rx] = -w;
            }
            else
            {
                root[ry] = rx;
                tsize[rx] += tsize[ry];
                weight[ry] = w;
            }

            return true;
        }
    };
}


/**************************************/
/*********** END OF NYA LIB ***********/
/**************************************/

using namespace NyaGadget;
//using mll = ModLL< 1000000007 >;
//using mll = ModLL< 998244353 >;

int main(void)
{
    ll N, M; cin >> N >> M;
    DS_WeightUnionFind<long long> wuf(N + 1);
    rep(i, 0, M)
    {
        ll l, r, d; cin >> l >> r >> d; l--, r--;
        if (wuf.Same(l, r))
        {
            if (wuf.Diff(l, r) != d)
            {
                cout << "No";
                return 0;
            }
        }
        else
        {
            wuf.Union(l, r, d);
        }
    }

    cout << "Yes";
    return 0;
}

Measured memory_bytes: 2560