#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn dfs(member: usize, informations: &Vec<Vec<(usize, i64)>>, dists: &mut Vec<i64>) -> bool {
    for &(to, d) in informations[member].iter() {
        if dists[to] != std::i64::MAX {
            if dists[to] != dists[member] + d {
                return false;
            }
        } else {
            dists[to] = dists[member] + d;
            if !dfs(to, informations, dists) {
                return false;
            }
        }
    }
    true
}

fn main() {
    let v = read_vec::<usize>();
    let (n, m) = (v[0], v[1]);

    let mut uft = UnionFindTree::new(n);

    let mut informations = vec![vec![]; n];
    for i in 0..m {
        let v = read_vec::<i64>();
        let (l, r, d) = (v[0] as usize - 1, v[1] as usize - 1, v[2]);
        informations[l].push((r, d));
        informations[r].push((l, -d));
        uft.unite(l, r);
    }

    let mut groups = HashMap::new();
    for i in 0..n {
        groups.entry(uft.find(i)).or_insert(vec![]).push(i);
    }

    let mut dists = vec![std::i64::MAX; n];
    for group in groups.values() {
        dists[group[0]] = 0;
        for &member in group.iter() {
            if !dfs(member, &informations, &mut dists) {
                println!("No");
                return;
            }
        }
    }
    println!("Yes");
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[derive(Debug, Clone)]
struct UnionFindTree {
    parent: Vec<isize>,
    size: Vec<usize>,
    height: Vec<u64>,
}

impl UnionFindTree {
    fn new(n: usize) -> UnionFindTree {
        UnionFindTree {
            parent: vec![-1; n],
            size: vec![1usize; n],
            height: vec![0u64; n],
        }
    }

    fn find(&mut self, index: usize) -> usize {
        if self.parent[index] == -1 {
            return index;
        }
        let idx = self.parent[index] as usize;
        let ret = self.find(idx);
        self.parent[index] = ret as isize;
        ret
    }

    fn same(&mut self, x: usize, y: usize) -> bool {
        self.find(x) == self.find(y)
    }

    fn get_size(&mut self, x: usize) -> usize {
        let idx = self.find(x);
        self.size[idx]
    }

    fn unite(&mut self, index0: usize, index1: usize) -> bool {
        let a = self.find(index0);
        let b = self.find(index1);
        if a == b {
            false
        } else {
            if self.height[a] > self.height[b] {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
            } else if self.height[a] < self.height[b] {
                self.parent[a] = b as isize;
                self.size[b] += self.size[a];
            } else {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
                self.height[a] += 1;
            }
            true
        }
    }
}


Measured memory_bytes: 28924