#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

const int nmax=50005;
const int inf=1e9;

typedef pair<int,int> ii;
vector<ii> g[nmax];
int dist[nmax];
int n,m;


int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int x,y,i,c;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        dist[i]=inf;
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        g[x].push_back(ii(y,c));
    }
    priority_queue<ii,vector<ii>,greater<ii> > pq;
    pq.push(ii(0,1));
    int node,cost,currnode,currcost,sz;
    dist[1]=0;
    while(!pq.empty())
    {
        node=pq.top().second;
        cost=pq.top().first;
        if(cost>dist[node])
            continue;
        pq.pop();
        sz=g[node].size();
        for(i=0;i<sz;++i)
        {
            currnode=g[node][i].first;
            currcost=g[node][i].second;
            if(dist[node]+currcost<dist[currnode])
            {
                dist[currnode]=dist[node]+currcost;
                pq.push(ii(dist[currnode],currnode));
            }
        }
    }
    for(i=2;i<=n;i++)
        if(dist[i]==inf)
            printf("0 ");
        else
            printf("%d ",dist[i]);

}