#include <fstream>
#include <queue>

using namespace std;

ifstream fin("alee.in");
ofstream fout("alee.out");

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

struct info
{
    int nod,cost;
};

struct graf
{
    int nod;
};

const int N=50000;
const long long inf=(1LL<<60);
long long best[N+5];

bool operator<(graf a,graf b)
{
    return best[a.nod]>best[b.nod];
}

int n,m;
vector<info>v[N+5];

priority_queue<graf>q;
bool pus[N+5];

int main()
{
    InParser fin("dijkstra.in");
    OutParser fout("dijkstra.out");
    fin>>n>>m;
    while(m--)
    {
        int a,b,c;
        fin>>a>>b>>c;
        v[a].push_back({b,c});
    }
    for(int i=2;i<=n;i++)
        best[i]=inf;
    best[1]=0;
    pus[1]=1;
    q.push({1});
    while(!q.empty())
    {
        int nod=q.top().nod;
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            int nod_nou=v[nod][i].nod;
            long long cost=best[nod]+v[nod][i].cost;
            if(cost<best[nod_nou])
            {
                best[nod_nou]=cost;
                if(pus[nod_nou]==0)
                {
                    q.push({nod_nou});
                    pus[nod_nou]=0;
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(best[i]==inf)
            fout<<0<<" ";
        else
            fout<<best[i]<<" ";
    }
    return 0;
}
/**
**/