#include"bits/stdc++.h"

using namespace std; 

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) int((a).size())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ROF(i,a,b) for(int i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const int LARGE_INT = 1e9+100;
const int INF = 2e9+100;
const LL INF_LL = (LL)INF * 300 * 300;
const int MOD = 1e9+7;

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

LL modpow(LL a, LL n) {
    LL res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}

const LL max_coin = 2600;
LL add_coin(LL a, LL b){
    return min(max_coin, a+b);
}

void Main()
{
    LL n,m,s;cin>>n>>m>>s;

    vector<vector<vector<LL>>> road(n);
    REP(i,m){
        LL u,v,a,b;
        cin>>u>>v>>a>>b;
        u--;
        v--;
        road[u].PB({v,a,b}); //next_station, coin, time
        road[v].PB({u,a,b}); //next_station, coin, time
    }

    vector<vector<LL>> exchange(n);
    REP(i,n){
        LL c,d;
        cin>>c>>d;
        exchange[i]={c,d}; //coin, time
    }

    priority_queue<VL, vector<VL>, greater<VL>> q;
    q.push({0, 0, min(max_coin,s)}); //time, station, coin;

    map<LL,LL> result; //station, time
    map<LL,LL> visited; //station+coin, time

    while(!q.empty()){
        LL time = q.top()[0];
        LL station = q.top()[1];
        LL coin = q.top()[2];
        q.pop();

        LL station_coin = station*max_coin + coin;

        if(result.find(station) == result.end()){
            result[station] = time;
        }
        if(SIZE(result) == n){
            break;
        }

        if(visited.find(station_coin) == visited.end()){
            visited[station_coin] = time;
        }
        else{
            continue;
        }

        //next station
        for(auto x : road[station]){ //next_station, coin, time
            LL next_station = x[0];
            LL use_coin = x[1];
            LL use_time = x[2];



            if(coin>=use_coin){
                if(visited.find(next_station*max_coin+(coin-use_coin)) == visited.end()){
                    q.push({time+use_time, next_station, coin-use_coin}); //time, station, coin;
                }
            }
        }


        //exchange coin
        LL exchange_coin = exchange[station][0];
        LL exchange_time = exchange[station][1];
        if(visited.find(station*max_coin+add_coin(coin, exchange_coin)) == visited.end()){
            q.push({time+exchange_time, station, add_coin(coin, exchange_coin)}); //time, station, coin;
        }

    }

    FOR(i,1,n){
        cout<<result[i]<<endl;
    }

	return;
}

int main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
    return 0;
}

Measured memory_bytes: 18016