#include <cstdio>
#include <vector>
#include <queue>

#define INF 99999999

using namespace std;

int n,m,D[50002];

vector < pair < int , int > > L[50002];
priority_queue < pair < int, int > > Heap;

void Dijkstra(int start)
{
    int neigh;
    int node,cost;
    int son;
    int sum;
    for(int i=1;i<=n;i++)
        D[i] = INF;
    D[start] = 1;
    Heap.push({0,start});
    while(!Heap.empty())
    {
        cost = Heap.top().first;
        node = Heap.top().second;
        Heap.pop();
        if(cost <= D[node])
        {
            neigh = L[node].size();
            for(int i=0;i<neigh;i++)
            {
                sum = L[node][i].first;
                son = L[node][i].second;
                if(D[son] > cost + sum)
                {
                    D[son] = cost + sum;
                    Heap.push({D[son],son});
                }
            }
        }
    }
}

int main()
{
    FILE*f=fopen("dijkstra.in","r");
    FILE*g=fopen("dijkstra.out","w");
    int a,b,c;
    fscanf(f,"%i %i",&n,&m);
    for(int i=1;i<=m;i++)
    {
        fscanf(f,"%i %i %i",&a,&b,&c);
        L[a].push_back({c,b});
    }
    Dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(D[i] != INF)
            fprintf(g,"%i ",D[i]);
        else
            fprintf(g,"0 ");
    }
    return 0;
}