using System;
using System.Collections.Generic;
using System.Linq;
namespace Practice
{
    class Program
    {
        static void Main(string[] args)
        {
            Solve();
        }
        private const int MOD = 1000000007;
        private struct Info
        {
            public int v;
            public int d;
        }
        private static List<Info>[] g;
        private static int[] x;
        private static int[] color;
        private static Queue<int> q = new Queue<int>();
        private static HashSet<int> remainV = new HashSet<int>();
        static void Solve()
        {
            var o = ReadAndParseIntArr();

            var n = o[0];
            var m = o[1];
            g = new List<Info>[n];
            for (int i = 0; i < n; ++i)
            {
                g[i] = new List<Info>();
            }

            var l = new int[m];
            var r = new int[m];
            var d = new int[m];
            for (int i=0;i<m;++i)
            {
                o = ReadAndParseIntArr();
                l[i] = o[0]-1;
                r[i] = o[1]-1;
                d[i] = o[2];
                var li = l[i];
                var ri = r[i];
                var di = d[i];
                var info = new Info() {
                    v = ri,
                    d = di,
                };

                g[li].Add(info);
                g[ri].Add(new Info() { v = li, d = -di });
            }

            color = new int[n];
            x = new int[n];
            for(int i=0;i<x.Length;++i)
            {
                x[i] = int.MinValue;
            }

            for(int i=0;i<n;++i)
            {
                if( color[i] == 0)
                {
                    bfs(i);
                }
            }
            for(int i=0;i<m;++i)
            {
                if(x[r[i]] - x[l[i]] != d[i])
                {
                    Console.WriteLine("No");
                    return;
                }
            }

            Console.WriteLine("Yes");
        }
        private static
            void bfs(int s)
        {
            x[s] = 0;
            color[s] = 1;
            q.Enqueue(s);
            while(q.Count >= 1)
            {
                int u = q.Dequeue();
                var list = g[u];
                foreach(var info in list)
                {
                    if(color[info.v] == 0)
                    {
                        color[info.v] = 1;
                        x[info.v] = x[u] + info.d;
                        q.Enqueue(info.v);
                    }
                }
                color[u] = 2;
            }
        }
        

        #region よく使う便利関数
        private static bool isPrime(long x)
        {
            if (x == 2) { return true; }
            if (x < 2 || x % 2 == 0) { return false; }
            long i = 3;
            while (i * i <= x)
            {
                if (x % i == 0) { return false; }
                i = i + 2;
            }
            return true;
        }
        private static long lcm(long x, long y)
        {
            return x / gcd(x, y) * y;
        }
        private static long gcd(long x, long y)
        {
            return y > 0 ? gcd(y, x % y) : x;
        }
        private static long pow(long x, long n)
        {
            if (n == 0) { return 1; }
            long res = pow(x * x % MOD, n / 2);
            if (n % 2 == 1)
            {
                res = res * x % MOD;
            }
            return res;
        }
        private static int ReadAndParseInt()
        {
            return int.Parse(Console.ReadLine());
        }
        private static int[] ReadAndParseIntArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        }
        private static long ReadAndParseLong()
        {
            return long.Parse(Console.ReadLine());
        }
        private static long[] ReadAndParseLongArr()
        {
            return Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse);
        }

        /// <summary>
        /// 指定した値以上の先頭のインデクスを返す
        /// </summary>
        /// <typeparam name="T">比較する値の型</typeparam>
        /// <param name="arr">対象の配列（※ソート済みであること）</param>
        /// <param name="start">開始インデクス [inclusive]</param>
        /// <param name="end">終了インデクス [exclusive]</param>
        /// <param name="value">検索する値</param>
        /// <param name="comparer">比較関数(インターフェイス)</param>
        /// <returns>指定した値以上の先頭のインデクス</returns>
        public static int LowerBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer)
        {
            int low = start;
            int high = end;
            int mid;
            while (low < high)
            {
                mid = ((high - low) >> 1) + low;
                if (comparer.Compare(arr[mid], value) < 0)
                    low = mid + 1;
                else
                    high = mid;
            }
            return low;
        }

        //引数省略のオーバーロード
        public static int LowerBound<T>(IReadOnlyList<T> arr, T value) where T : IComparable
        {
            return LowerBound(arr, 0, arr.Count, value, Comparer<T>.Default);
        }

        /// <summary>
        /// 指定した値より大きい先頭のインデクスを返す
        /// </summary>
        /// <typeparam name="T">比較する値の型</typeparam>
        /// <param name="arr">対象の配列（※ソート済みであること）</param>
        /// <param name="start">開始インデクス [inclusive]</param>
        /// <param name="end">終了インデクス [exclusive]</param>
        /// <param name="value">検索する値</param>
        /// <param name="comparer">比較関数(インターフェイス)</param>
        /// <returns>指定した値より大きい先頭のインデクス</returns>
        public static int UpperBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer)
        {
            int low = start;
            int high = end;
            int mid;
            while (low < high)
            {
                mid = ((high - low) >> 1) + low;
                if (comparer.Compare(arr[mid], value) <= 0)
                    low = mid + 1;
                else
                    high = mid;
            }
            return low;
        }

        //引数省略のオーバーロード
        public static int UpperBound<T>(IReadOnlyList<T> arr, T value)
        {
            return UpperBound(arr, 0, arr.Count, value, Comparer<T>.Default);
        }
        #endregion
    }
}

Measured memory_bytes: 39452