#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=55;
int dp[N][N*N],n,m,s,c[N],d[N],ans[N];
struct zh
{
	int x,y,z;
	bool operator<(const zh k)const
	{
		return z>k.z;
	}
	zh(){}
	zh(int _x,int _y,int _z):x(_x),y(_y),z(_z){}
};
vector<zh>e[N];
priority_queue<zh>pq;
signed main()
{
	ios::sync_with_stdio(false);
	cin>>n>>m>>s;
	if(s>2500) s=2500;
	for(int i=1;i<=n;i++)
	{
		ans[i]=1e18;
		for(int j=0;j<=2500;j++)
			dp[i][j]=1e18;
	}
	for(int i=1;i<=m;i++)
	{
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		if(c>2500) c=2500;
		e[a].push_back(zh(b,c,d));
		e[b].push_back(zh(a,c,d));
	}
	for(int i=1;i<=n;i++)
		cin>>c[i]>>d[i];
	dp[1][s]=0;
	pq.push(zh(1,s,0));
	while(!pq.empty())
	{
		auto k=pq.top();
		pq.pop();
		int x=k.x,y=k.y,z=k.z;
		if(dp[x][y]!=z)
			continue;
		ans[x]=min(ans[x],dp[x][y]);
		if(y+c[x]<=2500)
		{
			if(dp[x][y+c[x]]>dp[x][y]+d[x])
			{
				dp[x][y+c[x]]=dp[x][y]+d[x];
				pq.push(zh(x,y+c[x],dp[x][y+c[x]]));
			}
		}
		for(auto i:e[x])
		{
			int v=i.x,p=i.y,q=i.z;
			if(y>=p)
			{
				if(dp[v][y-p]>dp[x][y]+q)
				{
					dp[v][y-p]=dp[x][y]+q;
					pq.push(zh(v,y-p,dp[v][y-p]));	
				}
			}
		}
	}
	for(int i=2;i<=n;i++)
		cout<<ans[i]<<endl;
	return 0;
}