import java.io.IOException;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.util.List;
import java.util.TreeSet;

public class Main {
	int n;
	List<Integer>[] e;
	int[][] g;

	List<Integer> topologicalSort(List<Integer>[] e) {
		int n = e.length;
		int[] inDegree = new int[n];
		for (int i = 0; i < n; i++) {
			for (Integer to : e[i]) {
				inDegree[to]++;
			}
		}

		List<Integer> l = new LinkedList<Integer>();
		TreeSet<Integer> s = new TreeSet<Integer>();
		for (int i = 0; i < n; i++) {
			if (inDegree[i] == 0) {
				s.add(i);
			}
		}

		while (!s.isEmpty()) {
			int from = s.first();
			s.remove(from);
			l.add(from);
			for (Integer to : e[from]) {
				inDegree[to]--;
				if (inDegree[to] == 0) {
					s.add(to);
				}
			}
		}

		if (l.size() == n) {
			return l;
		} else {
			return null;
		}
	}

	void run() {
		MyScanner sc = new MyScanner();

		n = sc.nextInt();
		int m = sc.nextInt();
		g = new int[n][n];
		e = new LinkedList[n];
		for (int i = 0; i < n; i++) {
			e[i] = new LinkedList<Integer>();
		}
		for (int i = 0; i < m; i++) {
			int u = sc.nextInt() - 1;
			int c = sc.nextInt();
			int v = sc.nextInt() - 1;
			e[v].add(u);
			g[v][u] = c;
		}

		List<Integer> perm = topologicalSort(e);
		int[] ans = new int[n];
		ans[n - 1] = 1;
		for (int i = 0; i < n; i++) {
			int k = perm.get(i);
			for (Integer to : e[k]) {
				ans[to] += ans[k] * g[k][to];
			}
		}

		for (int i = 0; i < n - 1; i++) {
			if (e[i].size() == 0) {
				System.out.println(ans[i]);
			} else {
				System.out.println(0);
			}
		}
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}
		System.out.println("----------------------------" + '\n');
	}

	class MyScanner {
		int read() {
			try {
				return System.in.read();
			} catch (IOException e) {
				throw new InputMismatchException();
			}
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}