#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct Graph {
    static constexpr ll INF = 1LL << 60;
    struct VertexQ {
        bool operator<(const VertexQ &o) const {
            return c > o.c; // 逆
        }
        int i;
        ll c;
    };
    struct Vertex { int n; ll c; };
    struct Edge { int i, n, c; };
    Graph(int n, int m) : v(n, { -1, INF }), e(m), n(n), m(0) {}
    void add_edge(int a, int b, int c) {
        e[m] = { b, v[a].n, c };
        v[a].n = m;
        m++;
    }
    void dijkstra(int i) {
        for (int i = 0; i < n; i++) v[i].c = INF;
        priority_queue<VertexQ> q;
        q.push({ i, v[i].c = 0 });
        while (!q.empty()) {
            auto p = q.top(); q.pop();
            if (p.c > v[p.i].c) continue;
            for (int j = v[p.i].n; j >= 0; j = e[j].n) {
                Edge &o = e[j];
                ll c = p.c + o.c;
                if (c < v[o.i].c) q.push({ o.i, v[o.i].c = c });
            }
        }
    }
    vector<Vertex> v;
    vector<Edge> e;
    int n, m;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    cin >> n >> m;

    Graph g(n * 2, m * 4);
    for (int i = 0; i < m; i++) {
        int a, b, c, x;
        cin >> a >> b >> c >> x;
        a--; b--;

        if (x == 0) {
            g.add_edge(a, b, c);
            g.add_edge(b, a, c);
        } else {
            g.add_edge(n + a, b, c);
            g.add_edge(n + b, a, c);
        }
        g.add_edge(n + a, n + b, c);
        g.add_edge(n + b, n + a, c);
    }
    g.dijkstra(n + (n - 1));

    for (int i = 0; i < n - 1; i++) {
        cout << g.v[i].c << '\n';
    }

    return 0;
}