import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N, M;
    scan(N, M);
    alias T = Tuple!(long, long);
    auto G = new T[][](N);
    foreach (_; 0 .. M)
    {
        long L, R, D;
        scan(L, R, D);
        L--, R--;
        G[L] ~= T(R, D);
        G[R] ~= T(L, -D);
    }
    bool validate(long v)
    {
        auto ans = new long[](N);
        ans[] = long.max;
        ans[v] = 0;
        bool f(long x)
        {
            bool ret = true;
            foreach (t; G[x])
            {
                if (ans[t[0]] == long.max)
                {
                    ans[t[0]] = ans[x] - t[1];
                    ret = ret && f(t[0]);
                }
                else
                {
                    ret = ret && (ans[x] - ans[t[0]] == t[1]);
                }
            }
            return ret;
        }

        return f(v);
    }

    writeln(iota(N).all!(x => validate(x)) ? "Yes" : "No");
}
