#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <vector>

///PRACTICE

using namespace std;

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

const int NMAX=5e4+5;
const int INF=2e9;

vector<pair<int,int>>v[NMAX];
int dist[NMAX];
bool viz[NMAX];

priority_queue<pair<int,int>>q;

void dijkstra(int p)
{
    viz[p]=true;
    dist[p]=0;
    q.push(make_pair(0,1));
    while(!q.empty())
    {
        pair<int,int>p=q.top();
        q.pop();
        viz[p.second]=false;
        for(auto i:v[p.second])
        {
            if(dist[i.first]>dist[p.second]+i.second)
            {
                dist[i.first]=dist[p.second]+i.second;
                if(!viz[i.first])
                {
                    q.push(make_pair(-dist[i.first],i.first));
                    viz[i.first]=true;
                }
            }
        }
    }
}

int main()
{
    int n,m,i,j,x,y,c;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
        v[y].push_back(make_pair(x,c));
    }
    for(i=1;i<=n;i++)
        dist[i]=INF;
    dijkstra(1);
    for(i=2;i<=n;i++)
        if(dist[i]==INF)
            fout<<0<<" ";
        else
            fout<<dist[i]<<" ";
    return 0;
}