#include <cstdio>
#define MAXN 5001
int n, m, l, k;
int I[MAXN], J[MAXN], B[MAXN], T[MAXN];
int main() {
	freopen("work.in","r",stdin);
	freopen("work.out","w",stdout);
	scanf("%d %d", &n, &m);
	l = 0;
	for(int i=1; i<=m; i++) {
		scanf("%d %d %d", &I[i], &J[i], &B[i]);
		l += B[i];
	}
	if(l<0) {
		printf("NO SOLUTION\n");
		return 0;
	}
	l = 0;
	for(int i=1; i<=m; i++) {
		if(T[I[i]] == B[i] + T[J[i]])
			l++;
		else {
			T[I[i]] = B[i] + T[J[i]];
			l++;
		}
		if(l>n)
			break;
	}
	l = (1<<30)-1;
	for(int i=1; i<=n; i++)
		if(T[i]<l)
			l = T[i];
	for(int i=1; i<=n; i++)
		printf("%d\n", T[i]-l);
	return 0;
}