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);
    auto ans = new long[](N);
    ans[] = long.max;
    foreach (_; 0 .. M)
    {
        long L, R, D;
        scan(L, R, D);
        L--, R--;
        if (ans[L] == long.max && ans[R] == long.max)
        {
            ans[L] = 0;
            ans[R] = D;
            continue;
        }
        if (ans[L] == long.max)
        {
            ans[L] = ans[R] - D;
            continue;
        }
        if (ans[R] == long.max)
        {
            ans[R] = ans[L] + D;
            continue;
        }
        if (ans[R] - ans[L] != D)
        {
            writeln("No");
            return;
        }
        assert(ans[R] != long.max && ans[L] != long.max);
    }
    writeln("Yes");
}
