#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

ll modpow(ll a, ll n, ll m) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % m;
        a = a * a % m;
        n >>= 1;
    }
    return res;
}
ll modinv(ll a, ll m) {
    return modpow(a, m - 2, m);
}

int main() {
    init();

    ll n, m, s; cin >> n >> m >> s;
    vector<vector<tuple<int, int, ll>>> g(n);
    FOR(i, 0, m) {
        int u, v, a; ll b; cin >> u >> v >> a >> b;
        --u, --v;
        g[u].emplace_back(v, a, b);
        g[v].emplace_back(u, a, b);
    }
    VL ca(n), da(n);
    FOR(i, 0, n)cin >> ca[i] >> da[i];

    ll MAX = 50 * (n - 1);
    auto dis = defvec<ll>(LLINF, n, MAX + 1);
    dis[0][min(MAX, s)] = 0;
    PQ<tuple<ll, int, int>> dik;
    dik.emplace(0, 0, min(MAX, s));
    while (!dik.empty()) {
        ll d; int now, x;
        tie(d, now, x) = dik.top();
        dik.pop();
        if (dis[now][x] < d)continue;
        each(dest, g[now]) {
            int to, y; ll cost;
            tie(to, y, cost) = dest;
            if (x < y)continue;
            if (!chmin(dis[to][x - y], d + cost))continue;
            dik.emplace(d + cost, to, x - y);
        }
        if (chmin(dis[now][min(MAX, x + ca[now])], dis[now][x] + da[now])) {
            dik.emplace(dis[now][x] + da[now], now, min(MAX, x + ca[now]));
        }
    }
    FOR(i, 1, n)cout << *min_element(all(dis[i])) << "\n";
}

Measured memory_bytes: 6248