#include <cstdio>
#include <vector>
#include <queue>
#include <climits>
#define x first
#define y second
#define intmax 2000000000
using namespace std;
bool viz[50005];
int cost[50005];
vector<pair<int,int> > adc[50005];
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        adc[a].push_back({b,c});
    }
    for(int i=2;i<=n;++i)
        cost[i]=intmax;
    queue<int> q;
    q.push(1);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        viz[nod]=0;
        for(int i=0;i<adc[nod].size();++i)
            if(!viz[adc[nod][i].x] && cost[adc[nod][i].x]>cost[nod]+adc[nod][i].y)
            {
                cost[adc[nod][i].x]=cost[nod]+adc[nod][i].y;
                viz[adc[nod][i].x]=1;
                q.push(adc[nod][i].x);
            }
            else
                if(cost[adc[nod][i].x]>cost[nod]+adc[nod][i].y)
                    cost[adc[nod][i].x]=cost[nod]+adc[nod][i].y;
    }
    for(int i=2;i<=n;++i)
        if(cost[i]!=intmax)
            printf("%d ",cost[i]);
        else
            printf("0 ");
    return 0;
}