#include <iostream>
#include <algorithm>

#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>

#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>

#include<memory>


using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

template <class T>
using MINPQ = std::priority_queue<T, vector<T>, greater<T>>; //MINPQ<pii> pq;
template <class T>
using MAXPQ = std::priority_queue<T>;


const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
//const ll mod = 998244353;
const int dx4[4] = {0, 0, -1, 1};
const int dy4[4] = {-1, 1, 0, 0};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
#define stand(B, i) (((B>>i) & 1) == 1) ? true : false //Bのi番目のbitが1ならtrue, 0ならfalse

//debug
#define DEBUG

#define DUMPOUT cerr

#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() {DUMPOUT << endl;};

template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}

//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n, m;
int S;
int A[55], B[55], C[55], D[55];
struct edge{int to, money, cost;};
vector<vector<edge>> g(50 + 5);

vector<vector<int>> dijkstra(int s, int n, vector<vector<edge>>& g){
    priority_queue<pair<int, pii>, vector<pair<int, pii>>, greater<pair<int, pii>>> pque;
    vector<vector<int>> d(n, vector<int>(2501, INFLL));
    if (S >= 2500) S = 2500;
    d[s][S] = 0;
    pque.push({0, {s, S}}); //dist, vertex, money
    //bool visited[n][2501] = {};
    //visited[0][S] = true;

    while (!pque.empty()){
        auto p = pque.top(); pque.pop();
        int now = p.second.first; // vertex
        int now_m = p.second.second; //money
        if (d[now][now_m] < p.first) continue;
        bool flag = false;
        rep(j, 51) {
          if (flag) break;
          int nxm = now_m + C[now] * j;
          int nxt = p.first + D[now] * j;
          if (nxm >= 2500) {
            flag = true;
            nxm = 2500;
          }
          if (d[now][nxm] > nxt) {
            d[now][nxm] = nxt;
            pque.push({d[now][nxm], {now, nxm}});
          }
        }
        for (edge e: g[now]){
          int nxm = now_m;
          int nxt = p.first;
          if (e.money > nxm) continue;
          nxm -= e.money;
          if (nxm >= 2500) nxm = 2500;
          if (d[e.to][nxm] > nxt + e.cost){
            d[e.to][nxm] = nxt + e.cost;
            pque.push({d[e.to][nxm], {e.to, nxm}});
          }
        }
    }
    return d;
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m >> S;
  rep(i, m) {
    int u, v, a, b;
    cin >> u >> v >> a >> b;
    u--; v--;
    g[u].push_back(edge{v, a, b});
    g[v].push_back(edge{u, a, b});
  }
  rep(i, n) {
    cin >> C[i] >> D[i];
  }
  vector<vector<int>> d = dijkstra(0, n, g);
  rep2(i, 1, n) {
    int ans = INFLL;
    rep(j, 2501) {
      ans = min(ans, d[i][j]);
    }
    cout << ans << endl;
  }
}


Measured memory_bytes: 28864