#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <algorithm>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <numeric>
#include <vector>
#include <array>
#include <queue>
#include <map>

using namespace std;

// template {{{
// misc {{{
using Z = long long;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << "\e[0m" << endl;
    exit(1);
  }
  int size = distance(begin(container), end(container));
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
template <class T, class U>
istream& operator>> (istream& is, pair<T, U>& p) {
  is >> p.first >> p.second;
  return is;
}
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
// }}}
// }}}


template <class Cost>
struct edge {
  Z to, next_silver;
  Cost cost;
};

// pos, silver
template <class Cost>
using Graph = vector<vector<vector<edge<Cost>>>>;
// dijkstra {{{
template <class Cost>
vector<vector<Cost>> dijkstra(Graph<Cost> const& gr, Z start, Z isil, Cost Infinity = numeric_limits<Cost>::max() / 3) {
  Z N = gr.size();
  Z MS = ix(gr, 0).size();
  vector<vector<Cost>> dists(N, vector(MS, Infinity));
  using P = pair<Z, Z>;
  priority_queue<pair<Cost, pair<Z, Z>>, vector<pair<Cost, pair<Z, Z>>>, greater<pair<Cost, pair<Z, Z>>>> que;
  que.emplace(0, P{start, isil});
  while (!que.empty()) {
    Cost d;
    pair<Z, Z> v;
    tie(d, v) = que.top();
    que.pop();
    if (d >= ix(dists, v.first, v.second)) continue;
    ix(dists, v.first, v.second) = d;
    for (auto&& e : ix(gr, v.first, v.second)) {
      Cost nd = e.cost + d;
      if (nd >= ix(dists, e.to, e.next_silver))
        continue;
      que.emplace(nd, P{e.to, e.next_silver});
    }
  }
  return dists;
}
// }}}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  Z N, M, S;
  cin >> N >> M >> S;
  Z MS = 7500;
  Graph<Z> gr(N, vector<vector<edge<Z>>>(MS));
  for (auto i = 0; i < M; i++) {
    Z u, v, a, b;
    cin >> u >> v >> a >> b;
    u--; v--;
    for (auto j = 0; j < MS - a; j++) {
      ix(gr, u, j + a).push_back({v, j, b});
      ix(gr, v, j + a).push_back({u, j, b});
    }
  }
  for (auto i = 0; i < N; i++) {
    Z c, d;
    cin >> c >> d;
    for (auto j = 0; j < MS - c; j++) {
      ix(gr, i, j).push_back({i, j + c, d});
    }
  }
  auto const& dists = dijkstra(gr, 0, min(S, MS - 1));
  for (auto i = 1; i < N; i++) {
    cout << *min_element(begin(ix(dists, i)), end(ix(dists, i))) << '\n';
  }
}



Measured memory_bytes: 89852