#include <fstream>
#include <vector>
#include <queue>
#include <limits>

using namespace std;

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

int n,m,i,x,y,c,d[50010],viz[50010];

struct cmp
{
    bool operator()(int x,int y)
    {
        return d[x]>d[y];
    }
};

vector<pair<int,int>>v[50010];
priority_queue<int,vector<int>,cmp>q;

void dijkstra(int x)
{
    int inf=2000000000;
    int vecin,cost;
    for(i=1; i<=n; i++)
        d[i]=inf;
    d[x]=0;
    viz[x]=1;
    q.push(x);
    while(!q.empty())
    {
        x=q.top();
        q.pop();
        viz[x]=0;
        for(auto it:v[x])
        {
            vecin=it.first;
            cost=it.second;
            if(d[vecin]>d[x]+cost)
            {
                d[vecin]=d[x]+cost;
                if(viz[vecin]==0)
                {
                    viz[vecin]=1;
                    q.push(vecin);
                }
            }
        }
    }

    for(i=2; i<=n; i++)
        if(d[i]==inf)cout<<"0 ";
        else
            cout << d[i]<<' ';
}

int main()
{
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    dijkstra(1);
    return 0;
}