#include<cstdio>
#include<vector>
#include<queue>
#include<fstream>
#include<deque>
#define pii pair<int,int>

using namespace std;

const int nmax = 50005;

int n,m,x,y,c,i,d[nmax];

vector<pii> v[nmax];

priority_queue<pii,vector<pii>,greater<pii> > q;

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

int main()
{
	in >> n >> m;

	for(;m;m--)
	{
	    in >> x >> y >> c;
	    scanf("%d%d%d",&x,&y,&c);
	    v[x].push_back(make_pair(y,c));
	}
	for(i=2;i<=n;i++)
        d[i]=1<<30;

	q.push(make_pair(0,1));

	while(!q.empty())
	{
	    x=q.top().second;
	    q.pop();
	    for(vector<pii>::iterator it=v[x].begin();it!=v[x].end();it++)
        {   if(d[x]+it->second<d[it->first])
            {
                d[it->first]=d[x]+it->second;
                q.push(make_pair(d[it->first],it->first));
            }
        }
	}
	for( i= 2; i<=n; ++i )
    {
        if(d[i]==1<<30) out << "0 ";
        else out << d[i] << " ";
    }
	return 0;
}