#include <bits/stdc++.h>
using namespace std;

using i64 = int64_t;

#define rep(i, x, y) for (i64 i = i64(x), i##_max_for_repmacro = i64(y); i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif

template <i64 p>
class fp {
    public:
    i64 x;
    fp() : x(0) {}
    fp(i64 x_) : x((x_ % p + p) % p) {}
    fp operator+() const { return fp(x); }
    fp operator-() const { return fp(-x); }
    fp& operator+=(const fp& y) {
        x += y.x;
        if (x >= p) x -= p;
        return *this;
    }
    fp& operator-=(const fp& y) { return *this += -y; }
    fp& operator*=(const fp& y) {
        x = x * y.x % p;
        return *this;
    }
    fp& operator/=(const fp& y) { return *this *= fp(inverse(y.x)); }
    fp operator+(const fp& y) const { return fp(x) += y; }
    fp operator-(const fp& y) const { return fp(x) -= y; }
    fp operator*(const fp& y) const { return fp(x) *= y; }
    fp operator/(const fp& y) const { return fp(x) /= y; }
    bool operator==(const fp& y) const { return x == y.x; }
    bool operator!=(const fp& y) const { return !(*this == y); }
    i64 extgcd(i64 a, i64 b, i64& x, i64& y) {
        i64 d = a;
        if (b != 0) {
            d = extgcd(b, a % b, y, x);
            y -= (a / b) * x;
        } else {
            x = 1;
            y = 0;
        }
        return d;
    }
    i64 inverse(i64 a) {
        i64 x, y;
        extgcd(a, p, x, y);
        return (x % p + p) % p;
    }
};

template <i64 p>
i64 abs(const fp<p>& x) { return x.x; }

template <i64 p>
istream& operator>>(istream& is, fp<p>& x) {
    is >> x.x;
    return is;
}

template <i64 p>
ostream& operator<<(ostream& os, const fp<p>& x) {
    os << x.x;
    return os;
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    os << "[";
    for (const auto& v : vec) {
        os << v << ",";
    }
    os << "]";
    return os;
}

template <typename T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename A, typename T, size_t size>
void fill(A (&ary)[size], const T& val) {
    fill((T*)ary, (T*)(ary + size), val);
}

constexpr int inf = 1.01e9;
constexpr i64 inf64 = 4.01e18;
constexpr long double eps = 1e-9;

// double(64bit浮動小数)のn分探索のループ回数の上限(2分探索なら50でも十分かもしれない). long double(80ビットの x87 浮動小数点型?)だと, 2分探索であってもこれだと足りないケースがある気がするので, もうちょっと余裕を持たせた方が良さそう.
constexpr i64 max_loop = 100;

void solve() {
    //constexpr i64 mod = 1'000'000'007;
    i64 N,M,S;
    cin >> N >> M >> S;

    using tup=tuple<i64,i64,i64>;
    vector<i64> U(M),V(M),A(M),B(M);
    vector<vector<tup>> g(N);
    rep(i,0,M){
        cin >> U[i] >> V[i] >> A[i] >> B[i];
        --U[i];
        --V[i];
        g[U[i]].emplace_back(make_tuple(V[i],A[i],B[i]));
        g[V[i]].emplace_back(make_tuple(U[i],A[i],B[i]));
    }

    vector<i64> C(N),D(N);
    rep(i,0,N) cin >> C[i] >> D[i];

    constexpr i64 maxi=2600;
    chmin(S,maxi);

    vector<vector<i64>> dist(N,vector<i64>(maxi+1,inf64));
    priority_queue<tup,vector<tup>,greater<tup>> que;
    dist[0][S]=0;
    que.push(make_tuple(0,0,S));
    while(!que.empty()){
        auto [d,u,s]=que.top();
        que.pop();
        if(d>dist[u][s]) continue;
        for(auto& e:g[u]){
            auto [v,cost,d2]=e;
            if(cost>s) continue;
            if(dist[v][s-cost]<=d+d2) continue;
            dist[v][s-cost]=d+d2;
            que.push(make_tuple(d+d2,v,s-cost));
        }
        {
            i64 ns=min(s+C[u],maxi);
            i64 nd=d+D[u];
            if(dist[u][ns]<=nd) continue;
            dist[u][ns]=nd;
            que.push(make_tuple(nd,u,ns));
        }
    }

    vector<i64> ans(N,inf64);
    rep(i,1,N) rep(j,0,maxi) chmin(ans[i],dist[i][j]);
    rep(i,1,N) cout << ans[i] << endl;
}

int main() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    solve();
    return 0;
}


Measured memory_bytes: 7324