#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=b-1;i>=a;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

ll AK[105],BK[105];
ll ma=0;

struct Edge {
  ll to,cost;
  Edge(ll to, ll cost) : to(to), cost(cost) {}
};

typedef vector<vector<Edge> > AdjList; // 辺の情報
typedef vector<ll> dis_dijkstra; // 距離のvector

dis_dijkstra dijkstra(ll n ,AdjList A,ll st ,ll weigh){// 頂点数 n ,グラフ　A　,始点　st　,初期値 weigh
  dis_dijkstra DIS;
  vector<bool> chek;
  DIS = vector<ll>(n+1, LINF);
  chek = vector<bool>(n+1, 0); 
  DIS[st]=weigh;
  ll key=st;
  priority_queue <pair<ll,ll>> PQ;
  PQ.push(mp(weigh,st));
  while(!PQ.empty()){
    pair<ll,ll> f = PQ.top();
    PQ.pop();
    key=f.second;
    chek[key]=1;
    if(DIS[key] < f.first*(-1)){
      continue;
    }
    rep(j,A[key].size()){
      ll v = A[key][j].to;
      if(chek[v]==0 && DIS[v]>DIS[key]+A[key][j].cost){
        DIS[v] = DIS[key] + A[key][j].cost;
        PQ.push(mp(DIS[v]*(-1),v));
      }
    }
  }
  return DIS;
}

ll U[107],V[107],A[107],B[107];

int main(){
  ll N, M ,S;
  cin >> N >> M >> S;
  AdjList graph;
  rep(i,M){
    cin >> U[i] >> V[i] >> A[i] >> B[i];
    ma=max(ma,A[i]);
  }
  Rep(i,1,N+1){
    cin >>  AK[i] >>  BK[i] ;
  }
  graph = AdjList(ma*N*100+100);
  rep(i,M){
    rep(j,ma*N+1){
      if(j-A[i]>=0){
        graph[j*100+U[i]].push_back(Edge((j-A[i])*100+V[i],B[i]));
        graph[j*100+V[i]].push_back(Edge((j-A[i])*100+U[i],B[i]));
      }
    }
  }
  Rep(i,1,N+1){
    rep(j,ma*N-AK[i]+1){
      graph[j*100+i].push_back(Edge((j+AK[i])*100+i,BK[i]));
    }
  }
  S=min(S,ma*N);
  dis_dijkstra dis = dijkstra(ma*N*100+100,graph,S*100+1,0ll);
  Rep(i,2,N+1){
    ll Z=LINF;
    rep(j,ma*N+1){
      Z=min(Z,dis[j*100+i]);
    }
    cout << Z << endl;
  }
}

Measured memory_bytes: 44840