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

using namespace std;

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

const int NMAX=50005;

priority_queue <pair <int,int>> q;

vector <pair <int,int>> graf[NMAX];

int n,m,sol[NMAX];

void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        in>>x>>y>>z;
        graf[x].push_back({y,z});
        graf[y].push_back({x,z});
    }
}

void bfs()
{
    q.push({1,0});
    sol[1]=1;
    while(!q.empty())
    {
        pair <int,int> nownod=q.top();
        q.pop();
        int nr=graf[nownod.first].size();
        for(int i=0;i<nr;i++)
        {
            pair <int,int> nextnod=graf[nownod.first][i];
            int sum=sol[nownod.first]+nextnod.second;
            if(sol[nextnod.first]==0 || sum<sol[nextnod.first])
            {
                q.push({nextnod.first,-nextnod.second});
                sol[nextnod.first]=sum;
            }
        }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        out<<sol[i]-1<<" ";
    }
}

int main()
{
    citire();
    bfs();
    afisare();
    return 0;
}