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

const int N = 1e5 + 10;

using edge = pair<long long, int>;

int n, m;
vector<edge> g[N * 2];

long long dis[N * 2];

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

    cin >> n >> m;
    for(int i = 1, u, v, w, b; i <= m; i ++) {
        cin >> u >> v >> w >> b;
        g[u].push_back({w, v});
        g[v].push_back({w, u});
        
        g[N + u].push_back({w, N + v});
        g[N + v].push_back({w, N + u});
        
        if(b) {
            g[u].push_back({w, N + v});
            g[v].push_back({w, N + u});
        
            g[N + u].push_back({w, v});
            g[N + v].push_back({w, u});
        }
    }

    memset(dis, 0x3f, sizeof dis);
    dis[N + n] = 0;
    priority_queue<edge, vector<edge>, greater<edge> > pq;
    pq.push({0, N + n});
    while(pq.size()) {
        auto [d, u] = pq.top();
        pq.pop();

        if(dis[u] < d) continue;

        for(auto [w, v] : g[u]) {
            if(dis[v] > dis[u] + w) {
                dis[v] = dis[u] + w;
                pq.push({dis[v], v});
            }
        }
    }

    for(int i = 1; i < n; i ++)
        cout << dis[i] << "\n";

}