#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
using namespace std;

ifstream f("dijstrka.in");
ofstream g("dijstrka.out");

struct coord
{
    int val,cost;
    bool operator < (const coord &other)const
    {
        return cost>other.cost;
    }
};

int n,m;
vector<coord> v[50005];
bool viz[50005];
int dist[50005];

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

void solve()
{
    priority_queue<coord> q;
    q.push({1,0});
    while(!q.empty())
    {
        int val = q.top().val;
        int cost = q.top().cost;
        q.pop();
        if(viz[val] == false)
        {
            viz[val] = true;
            dist[val] = cost;
            for(int j=0;j<v[val].size();j++)
            {
                if(viz[v[val][j].val] == false)
                    q.push({v[val][j].val,cost+v[val][j].cost});
            }
        }
    }
    for(int i=2;i<=n;i++)
        g<<dist[i]<<" ";
}

int main()
{
    citire();
    solve();
}