#include <bits/stdc++.h>

#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

#define cin fin
#define cout fout

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

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

vector<pair<int,int>>v[NMAX];
priority_queue<pair<int,int>>pq;

int dist[NMAX];
bool viz[NMAX];

void dijkstra(int p)
{
    viz[p]=true;
    dist[p]=0;
    pq.push(make_pair(0,p));
    while(!pq.empty())
    {
        pair<int,int>p=pq.top();
        pq.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])
                {
                    viz[i.first]=true;
                    pq.push(make_pair(-dist[i.first],i.first));
                }
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

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