import java.util.Map.Entry;
import java.io.*;
import java.util.*;

public class Main {
	
	public static void main(String[] args) throws IOException {
		FastScanner sc = new FastScanner(System.in);
		
		int N = sc.nextInt();
		int M = sc.nextInt();
		ArrayList<ArrayList<Edge>> graph = new ArrayList<ArrayList<Edge>>();
		for(int i = 0; i < N; i++) graph.add(new ArrayList<Edge>());
				
		for(int i = 0; i < M; i++){
			int L = sc.nextInt()-1;
			int R = sc.nextInt()-1;
			int D = sc.nextInt();
			graph.get(L).add(new Edge(R, D));
			graph.get(R).add(new Edge(L, -D));
		}
		
		int[] x = new int[N];
		boolean[] visited = new boolean[N];
		
		for(int s = 0; s < N; s++){
			if(visited[s]) continue;
			LinkedList<Integer> queue = new LinkedList<>();
			queue.push(s);
			while(!queue.isEmpty()){
				int v = queue.pop();
				visited[v] = true;
				for(Edge e : graph.get(v)){
					if(!visited[e.to]){
						x[e.to] = x[v] + (int)e.cost;
						queue.push(e.to);
					}else{
						if(x[e.to] != x[v] + (int)e.cost){
							System.out.println("No");
							return;
						}
					}
				}
			}
		}
		System.out.println("Yes");
	}
}

class Edge{
	int to;
	long cost;
	public Edge(int t, long c){
		to = t;
		cost = c;
	}
}

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() {
    	if (hasNextByte()) return buffer[ptr++];
    	else return -1;
    }
    private static boolean isPrintableChar(int c){
    	return 33 <= c && c <= 126;
    }
    public boolean hasNext() {
    	while(hasNextByte() && !isPrintableChar(buffer[ptr]))
    		ptr++; return hasNextByte();
    }
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
    	return Double.parseDouble(next());
    }
}


Measured memory_bytes: 66244