// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
static immutable MOD=10^^9+7;alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std, core.bitop;
// dfmt on

void main()
{
    long N, M;
    scan(N, M);
    auto graph = new long[long][](N);
    foreach (_; 0 .. M)
    {
        long l, r, d;
        scan(l, r, d);
        l--;
        r--;
        graph[l][r] = d;
        graph[r][l] = -d;
    }
    auto p = new long[](N);
    p[] = -long.min;
    bool ans = true;
    void solve(long x)
    {
        if (p[x] == long.min)
            p[x] = 0;
        foreach (k, v; graph[x])
        {
            if (p[k] == long.min)
            {
                p[k] = p[x] + v;
                solve(k);
            }
            else
            {
                if (p[k] - p[x] != v)
                {
                    ans = false;
                    return;
                }
            }

        }
    }

    foreach (i; 0 .. N)
        solve(i);
    writeln(ans ? "Yes" : "No");
}
