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)); }


int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  // if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


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

enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const K = 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();
        const tmp = readToken();
        foreach (k; 0 .. K) {
          X[i] |= (tmp[k] - '0') << k;
        }
      }
      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, "val", int, "key");
      BinaryHeap!(Array!Entry, "a.val > b.val") que;
      auto dist = new long[N];
      auto pred = new int[N];
      auto depth = new int[N];
      auto label = new int[N];
      dist[] = INF;
      pred[] = -1;
      que.insert(Entry(dist[S] = 0, S));
      for (; !que.empty; ) {
        const c = que.front.val;
        const u = que.front.key;
        que.removeFront;
        if (dist[u] == c) {
          foreach (i; G[u]) {
            const cc = c + C[i];
            const v = A[i] ^ B[i] ^ u;
            if (chmin(dist[v], cc)) {
              que.insert(Entry(cc, v));
              pred[v] = u;
              depth[v] = depth[u] + 1;
              label[v] = label[u] ^ X[i];
            }
          }
        }
      }
      debug {
        writeln("dist = ", dist);
        writeln("pred = ", pred);
        writeln("label = ", label);
      }
      
      
      auto qs = new long[N];
      qs[] = INF;
      auto uf = new int[N];
      uf[] = -1;
      
      auto hs = new long[M];
      foreach (i; 0 .. M) {
        if (label[A[i]] ^ label[B[i]] ^ X[i]) {
          hs[i] = dist[A[i]] + dist[B[i]] + C[i];
          que.insert(Entry(hs[i], i));
        } else {
          hs[i] = INF;
        }
      }
      debug {
        writeln("hs = ", hs);
      }
      
      for (; !que.empty; ) {
        const h = que.front.val;
        const i = que.front.key;
        que.removeFront;
        if (hs[i] == h) {
          int wa = uf.root(A[i]);
          int wb = uf.root(B[i]);
          int[] bs;
          for (; wa != wb; ) {
            if (depth[wa] >= depth[wb]) {
              bs ~= wa;
              wa = uf.root(pred[wa]);
            } else {
              bs ~= wb;
              wb = uf.root(pred[wb]);
            }
          }
          foreach (w; bs) {
            uf.connect(wa, w);
            qs[w] = hs[i] - dist[w];
            foreach (j; G[w]) {
              const x = A[j] ^ B[j] ^ w;
              if (chmin(hs[j], qs[w] + dist[x] + C[j])) {
                que.insert(Entry(hs[j], j));
              }
            }
          }
        }
      }
      
      
      auto ans = new long[N];
      foreach (u; 0 .. N) {
        ans[u] = label[u] ? dist[u] : qs[u];
      }
      
      foreach (u; 0 .. N - 1) {
        writeln((ans[u] >= INF) ? -1 : ans[u]);
      }
    }
  } catch (EOFException e) {
  }
}