#include <fstream>
#include <queue>
#include <climits>

using namespace std;

vector<pair<int,int>> G[50005];
//queue<pair<int,int>> q;

priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;

int dist[50005];

void dfs()
{
    for(int i=2;i<=50000;i++)
        dist[i] = INT_MAX;

    q.push(make_pair(0,1));

    while(!q.empty())
    {
        int nod, d;
        nod = q.top().second;
        d = q.top().first;
        q.pop();

        for(auto x:G[nod])
        {
            int newdist = dist[nod] + x.first;
            if(newdist < dist[x.second])
            {
                dist[x.second] = newdist;
                q.push(make_pair(newdist, x.second));
            }
        }
    }
}

int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");

    int n, m, x, y, d;
    cin >> n >> m;
    for(int i=0;i<m;i++)
    {
        cin >> x >> y >> d;
        G[x].push_back(make_pair(d,y));
    }

    dfs();

    for(int i=2;i<=n;i++)
    {
        if(dist[i] == INT_MAX)
            cout << "0 ";
        else
            cout << dist[i] << " ";
    }
    return 0;
}