#include<fstream>
#include<vector>
#include<queue>
using namespace std;
vector<unsigned>A[50001];
unsigned n,nod=1;
long m,d[50001];
void Dijkstra()
{
    for (unsigned i=1;i<=n;i++)
        d[i]=9999;
    d[1]=0;
    while(nod<=n)
    {
        for (unsigned i=1;i<=n;i++)
            if (d[i]>d[nod]+A[nod][i]) d[i]=d[nod]+A[nod][i];
        nod++;
    }
}
int main()
{
    ifstream f("dijkstra.in");
    ofstream f1("dijkstra.out");
    f>>n>>m;
    for (unsigned i=1;i<=n;i++)
        A[i].assign(n+1,9999);
    for (unsigned i=1;i<=m;i++)
    {
        unsigned a,b,c;
        f>>a>>b>>c;
        A[a][b]=A[b][a]=c;
    }
    Dijkstra();
    for (unsigned i=1;i<=n;i++)
        f1<<d[i]<<" ";
    return 0;
}