#include <fstream>
#include <vector>
#include <set>
#include <queue>
#define pii pair<int,int>

using namespace std;

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

long long int t,n,i,j,k,m,x,y,a,b,c,d[300005],ok[300005],u,v,w,sum,l,r,mini,nr,maxi,node;
const int MOD=1e9+7;
vector<pair<int,int>>g[300005];
set<pair<int,int>>s;
priority_queue < pii , vector < pii > , greater < pii > > pq;

void dijkstra()
{
    for(i=1;i<=n;i++)
        d[i]=1e9;
    d[1]=0;
    pq.push({0,1});
    while(pq.size())
    {
        int curr=pq.top().second;
        pq.pop();
        if(ok[curr]==1)
            continue;
        ok[curr]=1;
        for(auto x:g[curr])
        {
            int cost=x.first;
            int vec=x.second;
            if(ok[vec]==0 && d[curr]+cost<d[vec])
            {
                d[vec]=d[curr]+cost;
                pq.push({d[vec],vec});
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>m;
    for(i=1; i<=m; i++)
    {
        cin>>u>>v>>c;
        g[u].push_back({c,v});
    }
    dijkstra();
    for(i=2; i<=n; i++)
    {
        if(d[i]==1e9)
            d[i]=0;
        cout<<d[i]<<' ';
    }
    return 0;
}