#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>
using namespace std;
typedef pair<int,int> PII;
const int N=5e4+5;
int n,m,l,r;
int e[N],h[N],be[N],en[N],w[N],ne[N],cnt;
int dist[N],vis[N];

void join(int u,int v,int a,int b,int t)
{
	e[cnt]=v;
	be[cnt]=a;
	en[cnt]=b;
	w[cnt]=t;
	ne[cnt]=h[u];
	h[u]=cnt++;
}

int dijkstra()
{
	dist[l]=0;
	priority_queue<PII,vector<PII>,greater<>>p;
	p.push({l,0});
	while(p.size())
	{
		PII it=p.top();
		p.pop();
		int ver=it.first,time=it.second;
		if(vis[ver])continue;
		vis[ver]=1;
		for(int i=h[ver];i!=-1;i=ne[i])
		{
			int j=e[i];
			int Time=0;
			if(time%(be[i]+en[i])+w[i]>be[i])
			{
				Time=time+be[i]+en[i]-time%(be[i]+en[i])+w[i];
			}
			else Time=time+w[i];
			if(dist[j]>Time)
			{
				dist[j]=Time;
				p.push({j,dist[j]});
			}
		}
	}
	return dist[r];
}

int main()
{
	int k=0;
	while(scanf("%d %d %d %d",&n,&m,&l,&r)!=EOF)
	{
		k++;
		cnt=0;
		int u,v,a,b,t;
		for(int i=1;i<=max(n,m);i++)
		{
			dist[i]=1e9+100;
			vis[i]=0;
			h[i]=-1;
			e[i]=be[i]=en[i]=ne[i]=w[i]=0;
		}
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d %d %d %d",&u,&v,&a,&b,&t);
			join(u,v,a,b,t);
		}
		printf("Case %d: %d\n",k,dijkstra());
	}
	return 0;
}