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

using namespace std;

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

struct arc
{
    int x,c;
};

vector <arc> v[50001];
queue  <int> q;

int n,m,p,dist[50001],a,b,c;
bool viz[50001];

void dijkstra(int start)
{
    for(int i=1;i<=n;i++)
        dist[i]=999999999;
    dist[start]=0;
    viz[start]=1;
    q.push(start);
    while(!q.empty())
    {
        int i=q.front();
        q.pop();
        int m=v[i].size();
        for(int k=0;k<m;k++)
        {
            int j=v[i].at(k).x;
            int c=v[i].at(k).c;
            if(dist[j]>dist[i]+c)
            {
                dist[j]=dist[i]+c;
                viz[j]=1;
                q.push(j);
            }
        }
    }
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>a>>b>>c;
        v[a].push_back({b,c});
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
        g<<dist[i]<<" ";
}