#include <bits/stdc++.h>
using namespace std;

//////////////////////////////   Begin Macros

#define all(x) (x).begin(), (x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)
#define rep1rev(i, N) for (int i = (int)(N); i >= 0; i--)
#define forbe(i, b, e) for (int i = (b); i < (e); i++)
#define forberev(i, b, e) for (int i = (e)-1; i >= (b); i--)
#define forfl(i, f, l) for (int i = (f); i <= (l); i++)
#define forflrev(i, f, l) for (int i = (l); i >= (f); i--)
using ll = long long int;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &m, const T q)
{
  if (m < q)
  {
    m = q;
    return true;
  }
  else
    return false;
}
template <typename T>
bool chmin(T &m, const T q)
{
  if (m > q)
  {
    m = q;
    return true;
  }
  else
    return false;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first + r.first, l.second + r.second}; }
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return {l.first - r.first, l.second - r.second}; }
template <typename T>
pair<T, T> operator*(const pair<T, T> &l, const T &r) { return {l.first * r, l.second * r}; }
template <typename T>
pair<T, T> operator/(const pair<T, T> &l, const T &r) { return {l.first / r, l.second / r}; }
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
  for (auto &v : vec)
    is >> v;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec)
{
  os << "[";
  for (auto v : vec)
    os << v << ",";
  os << "]";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &vec)
{
  os << "deq[";
  for (auto v : vec)
    os << v << ",";
  os << "]";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &vec)
{
  os << "{";
  for (auto v : vec)
    os << v << ",";
  os << "}";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &vec)
{
  os << "{";
  for (auto v : vec)
    os << v << ",";
  os << "}";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &vec)
{
  os << "{";
  for (auto v : vec)
    os << v << ",";
  os << "}";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &vec)
{
  os << "{";
  for (auto v : vec)
    os << v << ",";
  os << "}";
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa)
{
  os << "(" << pa.first << "," << pa.second << ")";
  return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &mp)
{
  os << "{";
  for (auto v : mp)
    os << v.first << "=>" << v.second << ",";
  os << "}";
  return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp)
{
  os << "{";
  for (auto v : mp)
    os << v.first << "=>" << v.second << ",";
  os << "}";
  return os;
}

template <typename T>
void reset(vector<T> &v, const T reset_to)
{
  for (auto &x : v)
    x = reset_to;
}
inline int popcount(const unsigned int x) { return __builtin_popcount(x); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

ll nC2(ll n)
{
  return n * (n - 1) / 2;
}

const int intinf = numeric_limits<int>::max();
const ll llinf = numeric_limits<ll>::max();
const pii udlr[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

//////////////////////////////   End Macros

// Graph.h start--------------------------------------------

using Weight = pll;

struct Vertex;
struct Edge;

struct Vertex
{
  int id;
  std::vector<int> ids_dst;
  std::vector<Edge> edges;

  Vertex(const int id = 0) : id(id){};
  int &operator[](int n) { return ids_dst[n]; }

  size_t size();
  void add_edge(const Edge &e);
};

struct Edge
{
  int id_src, id_dst;
  Weight weight;

  Edge(const int id_src, const int id_dst, const Weight weight) : id_src(id_src), id_dst(id_dst), weight(weight){};
};
std::ostream &operator<<(std::ostream &os, const Edge &e) { return os << "(" << e.id_src << "->" << e.id_dst << "," << e.weight << ")"; }

struct Graph
{
  std::vector<Vertex> vertices;
  std::vector<Edge> edges;

  Graph(const int nvertices = 0);
  Vertex &operator[](int n) { return vertices[n]; }

  size_t size();
  void add_edge(const Edge &edge);
  void add_edge(const int id_src, const int id_dst, const Weight w) { add_edge(Edge(id_src, id_dst, w)); };
};
std::ostream &operator<<(std::ostream &os, const Graph &g)
{
  std::cout << "[" << std::endl;
  ;
  for (auto e : g.edges)
    os << " " << e << "," << std::endl;
  std::cout << "]";
  return os;
}

//----------------------------------------------------------

void Vertex::add_edge(const Edge &e)
{
  edges.push_back(e);
  ids_dst.push_back(e.id_dst);
}
size_t Vertex::size() { return edges.size(); }

bool operator<(const Edge &e1, const Edge &e2)
{
  return e1.weight != e2.weight ? e1.weight > e2.weight : // !!INVERSE!!
             e1.id_src != e2.id_src ? e1.id_src < e2.id_src : e1.id_dst < e2.id_dst;
}

Graph::Graph(const int nvertices)
{
  for (int id = 0; id < nvertices; id++)
    vertices.push_back(Vertex(id));
}
size_t Graph::size() { return vertices.size(); }
void Graph::add_edge(const Edge &edge)
{
  edges.push_back(edge);
  vertices[edge.id_src].add_edge(edge);
}

// Graph.h end----------------------------------------------

using Pwi = pair<Weight, int>;
int N, M, S;

vector<ll> dijkstra(const Graph &g, const int id_start, const ll INF)
{
  const int n = (int)(g.vertices.size());
  int maxs = 20000;
  vector<vector<ll>> d(maxs + 1, vector<ll>(n, INF)); // zero=10000
  int zero = 10000;
  forfl(s, 0, zero) d[s][id_start] = 0;
  vector<vector<bool>> is_used(maxs + 1, vector<bool>(n, false));
  priority_queue<Pwi, vector<Pwi>, greater<Pwi>> que;

  que.push(Pwi({0, zero}, id_start));
  while (!que.empty())
  {
    const int id_src = que.top().second; // que.top().first >= d[id_src]
    assert(que.top().first.second - S + zero < (ll)intinf);
    const int s = min((int)(que.top().first.second), maxs);
    que.pop();

    if (is_used[s][id_src])
      continue;
    int s_ = s;
    while (s_ >= 0 and !is_used[s_][id_src])
    {
      is_used[s_][id_src] = true;
      s_--;
    }
    for (const Edge &edge : g.vertices[id_src].edges)
    {
      const int id_dst = edge.id_dst;
      int ds = edge.weight.second;
      // dbg(id_src);
      // dbg(id_dst);
      // dbg(s);
      // dbg(ds);
      // dbg(s + ds - zero + S);
      if (s + ds - zero + S >= 0 and d[min(s + ds, maxs)][id_dst] > d[s][id_src] + edge.weight.first)
      {
        auto newcost = d[s][id_src] + edge.weight.first;
        const int news = min(s + ds, maxs);
        int news_ = news;
        while (news_ >= 0 and d[news_][id_dst] > newcost)
        {
          d[news_][id_dst] = newcost;
          news_--;
        }
        // dbg(id_src);
        // dbg(id_dst);
        // dbg(news);
        que.push(Pwi({d[news][id_dst], news}, id_dst));
      }
    }
  }

  return d[0];
}

void solve()
{
  cin >> N >> M >> S;
  vector<int> U(M), V(M), A(M), B(M);
  rep(i, M) cin >> U[i] >> V[i] >> A[i] >> B[i], U[i]--, V[i]--;
  vector<int> C(N), D(N);
  rep(i, N) cin >> C[i] >> D[i];

  Graph g(N);
  rep(i, M)
  {
    g.add_edge(U[i], V[i], {B[i], -A[i]});
    g.add_edge(V[i], U[i], {B[i], -A[i]});
  }
  rep(i, N)
  {
    g.add_edge(i, i, {D[i], C[i]});
  }

  vector<ll> ans = dijkstra(g, 0, llinf / 2);
  forbe(i, 1, N) cout << ans[i] << endl;
}

int main()
{
  // srand(time(0));
  cout << fixed << setprecision(15);

  solve();
  return 0;
}


Measured memory_bytes: 13616