/* -*- coding: utf-8 -*-
 *
 * 1601.cc:  No.1601 With Animals into Institute - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_M = 200000;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
typedef vector<pii> vpii;

/* global variables */

int cs[MAX_M], xs[MAX_M];
vpii nbrs[MAX_N];
ll ds[MAX_N * 2];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%d%d%d%d", &a, &b, cs + i, xs + i);
    a--, b--;
    nbrs[a].push_back(pii(b, i));
    nbrs[b].push_back(pii(a, i));
  }

  int st = (n - 1) << 1;
  fill(ds, ds + n * 2, LINF);
  ds[st] = 0;

  priority_queue<pli> q;
  q.push(pli(0, st));

  while (! q.empty()) {
    pli u = q.top(); q.pop();
    ll ud = -u.first;
    if (ds[u.second] != ud) continue;

    int ui = (u.second >> 1), ux = (u.second & 1);
    for (auto ve: nbrs[ui]) {
      int vi = ve.first, ei = ve.second;
      ll vd = ud + cs[ei];
      int vx = (ux | xs[ei]), v = ((vi << 1) | vx);
      if (ds[v] > vd) {
	ds[v] = vd;
	q.push(pli(-vd, v));
      }
    }
  }

  for (int i = 0; i < n - 1; i++)
    printf("%lld\n", ds[(i << 1) | 1]);

  return 0;
}