#include<fstream>
#include<vector>
#include<queue>
#include<functional>
#define NMAX 50001
#define INF 2500010
#include<stdio.h>

using namespace std;

//ifstream f("dijkstra.in");
FILE *f=fopen("dijkstra.in","r");
//ofstream g("dijkstra.out");
FILE *g=fopen("dijkstra.out","w");

int n, m, D[NMAX];

vector<pair<int, int> > B[NMAX];
priority_queue <pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > H;

void Citeste()
{
    int i, x, y, c;

    //f>>n>>m;
    fscanf(f,"%d %d",&n,&m);

    for (i=1; i<=m; ++i)
    {
        //f>>x>>y>>c;
        fscanf(f,"%d %d %d",&x,&y,&c);
        B[x].push_back(make_pair(c, y));
    }
}
void Initializeaza()
{
    int i;

    for (i=2; i<=n; ++i) D[i]=INF;

    D[1]=0;

    H.push(make_pair(0, 1));
}

void Solve()
{
    pair<int, int> pr;
    int z,lg;

    while (!H.empty())
    {
        int i,j;
        pr=H.top(); H.pop();
        i=pr.second;
        for(j=0;j<B[i].size();j++)
            {
                z=B[i][j].second;;
                lg=D[i]+B[i][j].first;
                if(lg<D[z])
                {
                    H.push(make_pair(lg,z));
                    D[z]=lg;
                }
            }
     }
}

void Scrie()
{
    int i;

    for (i=2; i<=n; ++i)
        if (D[i]==INF) //g<<"0 ";
              fprintf(g,"%d ",0);
            else //g<<D[i]<<" ";
               fprintf(g,"%d ",D[i]);
}

int main()
{
    Citeste();

    Initializeaza();

    Solve();

    Scrie();

//    f.close();
//    g.close();
    return 0;
}