#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;i++)
#define bFor(i,a,b) for(i=a;i>=(ll)b;i--)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N-1,0)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define pb push_back
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
const ll mod=1000000007;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n){
  ll res=1;
  while(n){
    if(n&1)res=res*a%mod;
    a=a*a%mod;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}
using P=pair<int,ll>;
using PP=pair<int,P>;
using UP=pair<ll,int>;
int main(){
  // startupcpp();
  // ll test;cin>>test;while(test--){
  int i,j,N,M,S,costsum=0;
  scanf("%d %d %d",&N,&M,&S);
  vector<vector<PP>> g(N);
  vector<int> cost(N);
  vec time(N);
  while(M--){
    int a,b;
    scanf("%d %d %d %d",&i,&j,&a,&b);
    --i;--j;
    costsum+=a;
    g[i].eb(j,P(a,b));
    g[j].eb(i,P(a,b));
  }
  rep(i,N){
    scanf("%d %lld",&cost[i],&time[i]);
    chmin(cost[i],costsum);
  }
  chmin(S,costsum);
  vec dist((costsum+1)*N,inf);
  vector<int> vis((costsum+1)*N,0);
  priority_queue<UP,vector<UP>,greater<UP>> que;
  que.push(UP(0,S));
  M=costsum+1;
  while(!que.empty()){
    UP x=que.top();que.pop();
    if(!chmin(dist[x.second],x.first))continue;
    i=x.second/M;
    j=x.second%M;
    for(PP next:g[i]){
      if(next.second.first>j||dist[next.first*M+j-next.second.first]!=inf)continue;
      que.push(UP(x.first+next.second.second,next.first*M+j-next.second.first));
    }
    vis[x.second]=1;
    while(j<costsum){
      x.first+=time[i];
      j=min(j+cost[i],costsum);
      if(vis[i*M+j]++)break;
      if(dist[i*M+j]==inf)que.push(UP(x.first,i*M+j));
    }
  }
  rep1(i,N){
    ll res=inf;
    rep(j,M){
      chmin(res,dist[i*M+j]);
    }
    printf("%lld\n",res);
  }
}

Measured memory_bytes: 8968