/*#include<fstream>
#include<vector>
using namespace std;
ifstream F("dijkstra.in");
ofstream G("dijkstra.out");
#define N 50001
vector<pair<int,int> > g[N];
int m,n,i,j,k,p[N],d[N],h[N],l,t,w,f;
int main()
{
    F>>n>>m;
    while(m--)
        F>>i>>j>>k,g[i].push_back({j,k});
    for(i=2;i<=n;++i)
        d[i]=p[i]=N;
    for(k=0,p[1]=h[++k]=1;k;) {
        for(t=h[1],h[1]=h[k--],p[h[1]]=w=1;(w<<1)<=k;w=f) {
            f=w<<1;
            if(f<k&&d[h[f+1]]<d[h[f]])
                f++;
            if(d[h[w]]<=d[h[f]])
                break;
            h[w]^=h[f]^=h[w]^=h[f],p[h[w]]=w,p[h[f]]=f;
        }
        for(i=0,l=g[t].size();i<l;++i) {
            if(d[g[t][i].first]>d[t]+g[t][i].second) {
                d[g[t][i].first]=d[t]+g[t][i].second;
                if(p[g[t][i].first]==N)
                    h[++k]=g[t][i].first,p[h[k]]=k;
                for(w=p[g[t][i].first];w>1&&d[h[w>>1]]>d[h[w]];w=f)
                    f=w>>1,h[w]^=h[f]^=h[w]^=h[f],p[h[w]]=w,p[h[f]]=f;
            }
        }
    }
    for(i=2;i<=n;++i)
        G<<(d[i]==N?0:d[i])<<" ";
    return 0;
}*/
#include<fstream>
#define INF 32000
using namespace std;
int d[50010],a[250010][4],i,ok,n,m;
int main()
{
	ifstream f("dijkstra.in");
	ofstream g("dijkstra.out");
	f>>n>>m;
	for(i=2;i<=n;i++) d[i]=INF;

	for(i=1;i<=m;i++)
 {
	 f>>a[i][1]>>a[i][2]>>a[i][3];
	 if(a[i][1]==1) d[a[i][2]]=a[i][3];
 }

 while(!ok)
 {
	 ok=1;
	 for(i=1;i<=m;i++)
		 if(d[a[i][2]]>d[a[i][1]]+a[i][3])
		 {
			 d[a[i][2]]=d[a[i][1]]+a[i][3];
			 ok=0;
		 }
  }

for(i=2;i<=n;i++)

 if(d[i]==INF) g<<"0"<<" ";
  else g<<d[i]<<" ";

}