import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


// https://arxiv.org/pdf/1906.04062v5.pdf

enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto A = new int[M];
      auto B = new int[M];
      auto C = new long[M];
      auto X = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
        C[i] = readLong();
        X[i] = readInt();
      }
      const S = N - 1;
      
      auto G = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      
      alias Entry = Tuple!(long, "c", int, "u", int, "s");
      BinaryHeap!(Array!Entry, "a.c > b.c") que;
      auto dist = new long[][](N, 2);
      foreach (u; 0 .. N) {
        dist[u][] = INF;
      }
      que.insert(Entry(dist[S][0] = 0, S, 0));
      for (; !que.empty; ) {
        const c = que.front.c;
        const u = que.front.u;
        const s = que.front.s;
        que.removeFront;
        if (dist[u][s] == c) {
          foreach (i; G[u]) {
            const cc = c + C[i];
            const v = A[i] ^ B[i] ^ u;
            const ss = s | X[i];
            if (chmin(dist[v][ss], cc)) {
              que.insert(Entry(cc, v, ss));
            }
          }
        }
      }
      
      foreach (u; 0 .. N - 1) {
        writeln((dist[u][1] >= INF) ? -1 : dist[u][1]);
      }
    }
  } catch (EOFException e) {
  }
}