#include <fstream>
#include <vector>
#include <queue>
#define inf 100000000
using namespace std;
int n,m,i,x,y,c,d[500001];
vector<pair<int,int> >G[50001];
priority_queue<int, vector<int>, greater<int> >Q;
void dijkstra()
{
    int i,x,y;
    for (i=2;i<=n;i++) d[i]=inf;
    Q.push(1);
    while (!Q.empty())
    {
        x=Q.top();
        Q.pop();
        for (i=0;i<G[x].size();i++)
        {
            y=G[x][i].first;
            if (d[y]>d[x]+G[x][i].second)
            {
                d[y]=d[x]+G[x][i].second;
                Q.push(y);
            }
        }
    }
}
int main()
{
    ifstream fin ("dijkstra.in");
    ofstream fout ("dijkstra.out");
    fin>>n>>m;
    for (i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
        G[y].push_back(make_pair(x,c));
    }

    dijkstra();
    for (i=2;i<=n;i++)
        fout<<d[i]<<" ";
    fin.close();
    fout.close();
    return 0;
}