#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector< pair<int,int> > v[50010];
priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > Q;
int dist[50010],viz[50010],n,m,a,b,c,i,n1,n2,d2,d1;
pair<int,int> per1,per2;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>a>>b>>c;
        v[a].push_back(pair<int,int>(b,c));
    }
    for(i=1;i<=n;i++)
        dist[i]=1000000000;
    Q.push(pair<int,int>(0,1));
    dist[1]=0;
    while(!Q.empty())
    {
        per1=Q.top();
        Q.pop();
        d1=per1.first;
        n1=per1.second;
        if(!viz[n1])
        {
            viz[n1]++;
            for(vector< pair<int,int> >::iterator it=v[n1].begin();it!=v[n1].end();it++)
            {
                per2=*it;
                n2=per2.first;
                d2=per2.second;
                if(dist[n2]>d2+dist[n1])
                {
                    dist[n2]=d2+dist[n1];
                    Q.push(pair<int,int>(dist[n2],n2));
                }
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(dist[i]==1000000000)
            g<<"0 ";
        else
            g<<dist[i]<<" ";
    }
    g<<'\n';
    return 0;
}