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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, u, v, w, c, x;
    ll d;
    cin >> n >> m;
    vector<vector<pair<int,int>>> g(2 * n);
    for(int i = 0; i < m; i++){
        cin >> u >> v >> w >> x;
        u--, v--;
        g[u].emplace_back(v + x * n, w);
        g[v].emplace_back(u + x * n, w);
        g[u + n].emplace_back(v + n, w);
        g[v + n].emplace_back(u + n, w);
    }
    priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<pair<ll,int>>> pq;
    vector<ll> dist(2 * n, 1ll << 60);
    dist[n - 1] = 0;
    pq.emplace(0, n - 1);
    while(!pq.empty()){
        tie(d, v) = pq.top();
        pq.pop();
        if(dist[v] > d)continue;
        for(auto &&p:g[v]){
            tie(u, w) = p;
            if(d + w >= dist[u])continue;
            dist[u] = d + w;
            pq.emplace(dist[u], u);
        }
    }
    for(int i = 0; i + 1 < n; i++){
        cout << dist[i + n] << '\n';
    }
}