#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
const int nmax=50005;
const int inf=1.e9;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
vector <ii> g[nmax+5];
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int i,n,m,u,s,w,v,d;
    ii front;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&u,&v,&w);
        g[u].push_back(ii(v,w));
    }
    vi dist(n+1,inf);
    dist[1]=0;
    priority_queue<ii,vector<ii>,greater<ii> > pq;
    pq.push(ii(0,1));
    while(!pq.empty())
    {
        front=pq.top();
        pq.pop();
        d=front.first;
        u=front.second;
        if(d>dist[u])
            continue;
        for(i=0;i<g[u].size();i++)
        {
            v=g[u][i].first;
            w=g[u][i].second;
            if(dist[u]+w<dist[v])
            {
                dist[v]=dist[u]+w;
                pq.push(ii(dist[v],v));
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(dist[i]==inf)
            printf("0 ");
        else
            printf("%d ",dist[i]);
    }
    return 0;
}