/*#include<stdio.h>
const int N=50001;
struct G {
    int a,b,c;
}g[5*N];
int m,i,o,n,d[N];
int main() {
    freopen("dijkstra.in","r",stdin),freopen("dijkstra.out","w",stdout),scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
        scanf("%d%d%d",&g[i].a,&g[i].b,&g[i].c);
    for(i=2;i<=n;i++)
        d[i]=N;
    while(!o) {
        for(o=i=1;i<=m;i++)
            if(d[g[i].b]>d[g[i].a]+g[i].c)
                o=0,d[g[i].b]=d[g[i].a]+g[i].c;
    }
    for(i=2;i<=n;i++)
        printf("%d ",d[i]==N?0:d[i]);
}*/
#include <fstream>
using namespace std;

#define inf 0xfffff

ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");

struct cell{long a,b,c;}a[250001];
long n,m,i,d[50001];

int main(){

	fi >> n >> m;
	for (i=1; i<=m; i++) fi >> a[i].a >> a[i].b >> a[i].c;

	for (i=1; i<=n; i++) if (!d[i]) d[i]=inf;
	d[1]=0;

	int ok=0;
	while (!ok){
		ok=1;
		for (i=1; i<=m; i++)
			if (d[a[i].b]>d[a[i].a]+a[i].c)
				ok=0,d[a[i].b]=d[a[i].a]+a[i].c;
	}

	for (i=2; i<=n; i++) fo << (d[i]<inf ? d[i]:0) << " ";

	return 0;
}