#include<fstream>
#include<vector>
#include<queue>
#include<algorithm>
#define inf 0x7FFFFFFFFFFFFFFF
using namespace std;

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

int n,m;
long long cost[50100];

vector<pair<int, int> > a[50100];
queue<int> Q;

int main()
{
    f>>n>>m;
    for(int i =1; i<=m; ++i)
    {
        int x,y,c;
        f>>x>>y>>c;
        a[x].push_back(make_pair(y,c));
    }

    for(int i = 1; i<=n; ++i)
        cost[i] = inf;

    cost[1] = 0;
    Q.push(1);

    while(!Q.empty())
    {
        int i = Q.front();
        Q.pop();

        for(int j = 0; j<a[i].size(); ++j)
        {
            int vec = a[i][j].first;
            int cost_m = a[i][j].second;

            long long  new_cost = cost[i] + cost_m;
            if(new_cost < cost[vec])
            {
                cost[vec] = new_cost;
                Q.push(vec);
            }
        }
    }

    for(int i = 2; i<=n; ++i)
        if(cost[i] == inf)
            g<<"0 ";
        else
            g<<cost[i]<<" ";
    g<<"\n";

    return 0;
}