#include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FORA(i, n) for (auto &&i : n)
#define POW(a, b) ((int)(pow(a, b) + .5))
#define MODULO(a, b) (((a) % (b)) < 0 ? (a) % (b) + (b) : (a) % (b))
#define DUMPOUT cerr
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
// pair
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0) DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                             \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                             \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
          << "    ",                                                          \
      dump_func(__VA_ARGS__)
#define PRINTARR(x, y)                                     \
  cerr << #x << "=\n";                                     \
  for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
  cerr << endl;
#define PRINTARR2(x, i0, i1)                                       \
  cerr << #x << "=\n";                                             \
  for (int ii0 = 0; ii0 < i0; ii0++) {                             \
    for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
    cerr << endl;                                                  \
  }
#else
#define DEB if (false)
#define DUMP(...)
#define PRINTARR(x, y)
#define PRINTARR2(x, i0, i1)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define pdouble pair<double, double>
#define ld long double
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-7, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
/*  set UnionFind BIT deque queue multiset segtree priority_queue bitset map vector
[&] { return; }();下のスラッシュを2つ追加しただけ.上のスラッシュを2つにすれば外れる.
//*/
#define MAXN 300000
struct info {
  int u, v, a, b;
};
struct edge {
  int to, cost;
};
vec<edge> G[MAXN];
vec<info> arr;
int d[MAXN];
int cc[60];
int dd[60];
int maxA = 0;
int vertexID(int v, int num) { return v * (maxA + 1) + num; }
void dijkstra(int s) {
  priority_queue<pint, vec<pint>, greater<pint> > que;
  fill(d, d + MAXN, INF);
  d[s] = 0;
  que.push(pint(d[s], s));
  while (!que.empty()) {
    pint p = que.top();
    que.pop();
    int v = p.snd;
    if (d[v] < p.fst) {
      continue;  // chmin関数でd[e.to]が複数回更新される可能性？
                 // ここで呼び出される前に最短が更新されているのかもしれない。
    }
    FORA(e, G[v]) {
      bool p = chmin(d[e.to], d[v] + e.cost);
      if (p) {
        que.push(pint(d[e.to], e.to));  //
      }
    }
  }
}
signed main() {
  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  int N, M, S;
  cin >> N >> M >> S;
  REP(i, M) {
    info ret;
    cin >> ret.u >> ret.v >> ret.a >> ret.b;
    ret.u--, ret.v--;
    chmax(maxA, ret.a);
    arr.pb(ret);
  }
  maxA *= N - 1;
  if (S >= maxA) S = maxA;
  REP(i, M) {
    info ele = arr[i];
    int u = ele.u;
    int v = ele.v;
    int a = ele.a;
    int b = ele.b;
    REP(j, maxA) {
      if (j + a <= maxA) {
        int j0 = j;
        int j1 = j + a;
        G[vertexID(u, j1)].pb(edge{vertexID(v, j0), b});
        G[vertexID(v, j1)].pb(edge{vertexID(u, j0), b});
      }
    }
  }
  REP(i, N) { cin >> cc[i] >> dd[i]; }
  REP(i, N) {
    REP(j, maxA) {
      if (j + cc[i] <= maxA) {
        int j0 = j;
        int j1 = j + cc[i];
        G[vertexID(i, j0)].pb(edge{vertexID(i, j1), dd[i]});
      }
    }
  }
  dijkstra(vertexID(0, S));
  REPI(i, N - 1) {
    int ans = INF;
    REPZ(j, maxA) { chmin(ans, d[vertexID(i, j)]); }
    print(ans);
  }
  //
  /*int N, M, S;
  cin >> N >> M >> S;
  map<pint, pint> ma;
  REP(i, M) {
    int p, q, a, b;
    cin >> p >> q >> a >> b;
    ma[mp(p, q)] = mp(a, b);
    ma[mp(q, p)] = mp(a, b);
    p--, q--;
    G[p].pb(q);
    G[q].pb(p);
    //    G[p][q] = 1;
    //    G[q][p] = 1;
  }
  REP(i, N) { cin >> c[i] >> d[i]; }
  fill(ans, ans + N, INF);
  fill(numS, numS + N, -INF);
  fill(minS, minS + N, INF);
  ans[0] = 0;
  numS[0] = S;
  minS[0]=
  while (1) {
    memcpy(ansOld, ans, sizeof(int) * N);
    REP(id, N) {
      if (ans[id] == INF) continue;
      FORA(e, G[id]) {
        pint p = ma[mp(id, e)];
        int vS = p.fst;
        int vT = p.snd;
        int ret = ans[id] + vT;

        chmin(ans[e], ret);
      }
    }
    bool ok = true;
    REP(i, N) ok = ok && ansOld[i] == ans[i];
    if (ok) {
      break;
    }
  }
  REP(i, N) {
    if (i != 0) print(ans[i]);
  }*/
}

Measured memory_bytes: 28912