using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using System.Numerics;
using static System.Math;
namespace Program {
    public class Solver {
        Random rnd = new Random();
        public void Solve() {
            var n = ri;
            var m = ri;
            var G = Enumerate(n, x => new List<KeyValuePair<int, long>>());
            for (int i = 0; i < m; i++)
            {
                var u = ri - 1;
                var v = ri - 1;
                var x = rl;
                G[u].Add(new KeyValuePair<int, long>(v, x));
                G[v].Add(new KeyValuePair<int, long>(u, x));
            }
            var vis = new bool[n];
            var P = new long[n];
            var f = new int[n];
            f[0] = 1;
            var ok = true;
            var cycle = false;
            var X = -1L;
            Action<int, int, long, int> dfs = null;
            dfs = (cur, prev, p, x) =>
            {
                vis[cur] = true;
                foreach (var t in G[cur])
                {
                    if (t.Key == prev) continue;
                    if (vis[t.Key])
                    {
                        cycle = true;
                        var np = t.Value - p;
                        var nx = -x;
                        if (nx == f[t.Key])
                        {
                            ok &= np == P[t.Key];
                        }
                        else
                        {
                            var npp = np - P[t.Key];
                            var nxx = f[t.Key] - nx;
                            ok &= Sign(npp) == Sign(f[t.Key] - nx);
                            ok &= Abs(npp) % 2 == 0;
                            X = Abs(npp) / 2;
                        }
                    }
                    else
                    {
                        var np = t.Value - p;
                        var nx = -x;
                        P[t.Key] = np;
                        f[t.Key] = nx;
                        dfs(t.Key, cur, np, nx);
                    }
                }
            };
            dfs(0, -1, 0, 1);
            Debug.WriteLine(P.AsJoinedString());
            Debug.WriteLine(f.AsJoinedString());
            var min = 1L;
            var max = long.MaxValue;
            for (int i = 0; i < n; i++)
            {
                if (f[i] == 1)
                {
                    if (P[i] <= 0) min = Max(min, -P[i] + 1);
                }
                else
                {
                    if (P[i] >= 0)
                        max = Min(max, P[i] - 1);
                }
            }
            Debug.WriteLine(min);
            Debug.WriteLine(max);
            if (cycle)
            {
                if (ok)
                {
                    var okok = true;
                    if (X != -1)
                    {
                        for (int i = 0; i < n; i++)
                        {
                            var p = P[i] + f[i] * X;
                            okok &= p > 0;
                            foreach (var t in G[i])
                            {
                                var np = P[t.Key] + f[t.Key] * X;
                                okok &= p + np == t.Value;
                            }
                        }
                        if (okok) Console.WriteLine(1);
                        else Console.WriteLine(0);
                    }
                    else
                    {
                        Console.WriteLine(Max(0, max - min + 1));
                    }
                }
                else
                {
                    Console.WriteLine(0);
                }
                return;
            }
            else Console.WriteLine(Max(0, max - min + 1));


        }
        const long INF = 1L << 60;
        static int[] dx = { -1, 0, 1, 0 };
        static int[] dy = { 0, 1, 0, -1 };
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

        static T[] Enumerate<T>(int n, Func<int, T> f) {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f(i);
            return a;
        }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;

    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }

    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }

        private byte read() {
            if (isEof) return 0;
            if (ptr >= len)
            {
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) <= 0)
                {
                    isEof = true;
                    return 0;
                }
            }
            return buf[ptr++];
        }

        public char Char() {
            byte b = 0;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }
        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}

#endregion



#region BinaryHeap
public class PriorityQueue<T> {
    readonly List<T> heap = new List<T>();
    readonly Comparison<T> compare;
    public PriorityQueue() { compare = Comparer<T>.Default.Compare; }

    public PriorityQueue(Comparison<T> comparison) { compare = comparison; }
    public PriorityQueue(IComparer<T> comparer) { compare = comparer.Compare; }

    public void Enqueue(T item) {
        var pos = heap.Count;
        heap.Add(item);
        while (pos > 0)
        {
            var par = (pos - 1) / 2;
            if (compare(heap[par], item) <= 0)
                break;
            heap[pos] = heap[par];
            pos = par;
        }
        heap[pos] = item;

    }

    public T Dequeue() {
        var ret = heap[0];
        var pos = 0;
        var x = heap[heap.Count - 1];

        while (pos * 2 + 1 < heap.Count - 1)
        {
            var lch = pos * 2 + 1;
            var rch = pos * 2 + 2;
            if (rch < heap.Count - 1 && compare(heap[rch], heap[lch]) < 0) lch = rch;
            if (compare(heap[lch], x) >= 0)
                break;
            heap[pos] = heap[lch];
            pos = lch;
        }
        heap[pos] = x;
        heap.RemoveAt(heap.Count - 1);
        return ret;

    }
    public T Peek() { return heap[0]; }
    public int Count { get { return heap.Count; } }
    public bool Any() { return heap.Count > 0; }

    public T[] Items {
        get {
            var ret = heap.ToArray();
            Array.Sort(ret, compare);
            return ret;
        }
    }
}
#endregion

Measured memory_bytes: 49140