#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
using namespace std;

typedef pair<int, int> pi;

vector<pi> graph[50005];
set<pi> s;
int d[50005], vis[50005];

int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    int n, m;
    f>>n>>m;
    int x, y, z;
    for(int i=0; i<m; i++)
    {
        f>>x>>y>>z;
        graph[x].push_back(make_pair(y,z));
    }
    for(int i=2; i<=n; i++)
        d[i] = 20001;
    s.insert(make_pair(0,1));
    while(!s.empty())
    {
        int k = s.begin()->second;
        s.erase(s.begin());
        for(auto edge : graph[k])
        {
            int newDist = d[k] + edge.second;
            if(newDist < d[edge.first])
            {
                if(d[edge.first] != 20001)
                    s.erase(s.find(make_pair(d[edge.first], edge.first)));
                d[edge.first] = newDist;
                s.insert(make_pair(newDist, edge.first));
            }
        }
    }
    for(int i=2; i<=n; i++)
        if(d[i] == 20001)
            g<<0<<" ";
        else
            g<<d[i]<<" ";
    return 0;
}