#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

template<typename ctype, ctype INF>
class Dijkstra{
public:
  typedef tuple<Int,ctype, ctype> T;  //for edge
  typedef tuple<ctype, Int, Int> T2; //for priority_queue
  Int V;
  vector<vector<T> > G;
  vector<vector<T> > rG;

  Dijkstra():V(-1){}
  Dijkstra(Int V):V(V),G(V),rG(V){}

  void add_edge(Int a,Int b,ctype c, ctype d, Int oneway = 0){
    assert(a >= 0 && b >= 0);
    assert(a < V && b < V);
    G[a].push_back(T(b, c, d));
    rG[b].push_back(T(a, c, d));
    if(!oneway) G[b].push_back(T(a, c, d)), rG[a].push_back(T(b, c, d));
  }

  vector<vector<ctype> > dijkstra(Int start, Int S, vector<P> C){
    Int M = 3000;
    vector<vector<ctype> > D(V, vector<Int>(M, INF));
    vector<vector<ctype> > visited(V, vector<Int>(M, 0));
    priority_queue<T2, vector<T2>, greater<T2> > Q;
    Q.push(T2(0, start, S)); //cost, pos, S
    D[start][S] = 0;
    while(!Q.empty()){
      ctype cost;
      Int pos, s;
      tie(cost, pos, s) = Q.top(); Q.pop();
      assert(!visited[pos][s] || D[pos][s] <= cost);
      if(visited[pos][s]++) continue;

      {
        Int to = pos;
        Int ncost = cost + C[pos].second;
        Int ns = s + C[pos].first;
        if(ns < M && D[to][ns] > ncost){
          D[to][ns] = ncost;
          Q.push(T2(ncost, to, ns));
        }
      }
      for(auto t:G[pos]){
        Int to, c, u; tie(to, c, u) = t;
        Int ncost = cost + c;
        Int ns = s - u;
        if(ns < 0) continue;
        if(D[to][ns] <= ncost) continue;
        D[to][ns] = ncost;
        Q.push(T2(ncost, to, ns));
      }
    }
    return D;
  }
};


signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int N, M, S;
  cin>>N>>M>>S;

  Dijkstra<Int, INF> dij(N);
  for(Int i=0;i<M;i++){
    Int u, v, a, b;
    cin>>u>>v>>a>>b; u--, v--;
    dij.add_edge(u, v, b, a);
  }
  vector<P> C(N);
  cin>>C;
  auto ans = dij.dijkstra(0, min(S, N * 51 + 100), C);
  for(Int i=1;i<N;i++){
    Int a = INF;
    for(Int j=0;j<(Int)ans[i].size();j++) Min(a, ans[i][j]);
    cout<<a<<endl;
  }


  return 0;
}


Measured memory_bytes: 8696