#include <bits/stdc++.h>

using namespace std;

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

int i,n,m,x,y,a,b,c,cost[30005],s,nr,mn,sol[30005];
vector <pair<int,int>> t[30005];
queue <int> coada;

void bfs()
{
    int i,k;
    coada.push(1);
    cost[1]=1;
    while (!coada.empty())
    {
        k=coada.front();
        coada.pop();
        for (i=0; i<t[k].size(); i++)
        {
            if (cost[t[k][i].first]==0)
            {
                cost[t[k][i].first]=cost[k]+1;
                sol[t[k][i].first]=t[k][i].second+sol[k];
                coada.push(t[k][i].first);
            }
        }
    }
}

int main()
{
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        t[a].push_back(make_pair(b,c));
        t[b].push_back(make_pair(a,c));
    }

    bfs();

    for (i=2; i<=n; i++)
        fout<<sol[i]<<" ";

    return 0;
}