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

#define maxN 50001

using namespace std;

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

int n,m,dist[maxN];
vector < pair<int,int> > G[maxN];

void citire()
{
    int x,y,c;
    fin>>n>>m;
    while (m--)
    {
        fin>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }
}

void Dijkstra(int nod)
{
    priority_queue < pair <int,int>, vector < pair <int,int> >, greater < pair<int, int> > > Q;
    dist[nod]=0;
    Q.push(make_pair(dist[nod],nod));
    while (!Q.empty())
    {
        int x=Q.top().second;
        Q.pop();
        for (int i=0; i<G[x].size(); ++i)
        {
            int vecin=G[x][i].first, cost=G[x][i].second;
            if (dist[vecin] > dist[x] + cost)
            {
                dist[vecin]=dist[x]+cost;
                Q.push(make_pair(dist[vecin],vecin));
            }
        }
    }
}

int main()
{
    citire();
    fill(dist+1,dist+n+1,1<<30);
    Dijkstra(1);
    for (int i=2; i<=n; ++i)
        dist[i]==1<<30 ? fout<<"0 " : fout<<dist[i]<<' ';
    return 0;
}