Problem:
Score : 600 points

Problem Statement

Kenkoooo found a simple connected graph.
The vertices are numbered 1 through n.
The i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.

Kenkoooo is trying to write a positive integer in each vertex so that the following condition is satisfied:

For every edge i, the sum of the positive integers written in Vertex u_i and v_i is equal to s_i.

Find the number of such ways to write positive integers in the vertices.

Constraints

2 \leq n \leq 10^5

1 \leq m \leq 10^5

1 \leq u_i < v_i \leq n

2 \leq s_i \leq 10^9

If i\neq j, then u_i \neq u_j or v_i \neq v_j.

The graph is connected.

All values in input are integers.

Input

Input is given from Standard Input in the following format:

n m
u_1 v_1 s_1
:
u_m v_m s_m

Output

Print the number of ways to write positive integers in the vertices so that the condition is satisfied.

Sample Input 1

3 3
1 2 3
2 3 5
1 3 4

Sample Output 1

1

The condition will be satisfied if we write 1,2 and 3 in vertices 1,2 and 3, respectively.
There is no other way to satisfy the condition, so the answer is 1.

Sample Input 2

4 3
1 2 6
2 3 7
3 4 5

Sample Output 2

3

Let a,b,c and d be the numbers to write in vertices 1,2,3 and 4, respectively.
There are three quadruples (a,b,c,d) that satisfy the condition:

(a,b,c,d)=(1,5,2,3)

(a,b,c,d)=(2,4,3,2)

(a,b,c,d)=(3,3,4,1)

Sample Input 3

8 7
1 2 1000000000
2 3 2
3 4 1000000000
4 5 2
5 6 1000000000
6 7 2
7 8 1000000000

Sample Output 3

0

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

//https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

//

fn run() {
    input! {
        n: usize,
        m: usize,
        e: [(usize1, usize1, i64); m],
    }
    let mut g = vec![vec![]; n];
    for (a, b, s) in e {
        g[a].push((b, s - 2));
        g[b].push((a, s - 2));
    }
    let mut dp: Vec<Option<(bool, i64)>> = vec![None; n];
    dp[0] = Some((true, 0));
    let mut stack = vec![0];
    let mut fix = (false, 0);
    'outer: while let Some(v) = stack.pop() {
        let p = dp[v].unwrap();
        for &(u, s) in &g[v] {
            if let Some(q) = dp[u] {
                if q.0 == !p.0 {
                    if s - p.1 != q.1 {
                        println!("0");
                        return;
                    }
                } else {
                    fix.0 = true;
                    fix.1 = if p.0 {s - p.1 - q.1} else {p.1 + q.1 - s} / 2;
                    break;
                } 
            } else {
                dp[u] = Some((!p.0, s - p.1));
                stack.push(u);
            }
        }
    }
    if fix.0 {
        let mut dp = vec![None; n];
        dp[0] = Some(fix.1);
        let mut stack = vec![0];
        while let Some(v) = stack.pop() {
            let val = dp[v].unwrap();
            for &(u, s) in &g[v] {
                if let Some(d) = dp[u] {
                    if d != s - val {
                        println!("0");
                        return;
                    }
                } else {
                    dp[u] = Some(s - val);
                    stack.push(u);
                }
            }
        }
        println!("1");
    } else {
        let mut l = 0;
        let mut r = 1_000_000_000 - 2;
        for v in 0..n {
            let p = dp[v].unwrap();
            if p.0 {
                if p.1 <= 0 {
                    l = std::cmp::max(l, -p.1);
                }
            } else {
                if p.1 >= 0 {
                    r = std::cmp::min(r, p.1);
                } else {
                    println!("0");
                }
            }
        }
        let ans = std::cmp::max(r - l + 1, 0);
        println!("{}", ans);
    }
}

fn main() {
    run();
}