#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mk make_pair
struct EDGE	{
	int u,v,w,a,b;
}e[8005];
int t[1005],w[1005];
double p[1005];
vector<int> edge[1005];
int n,m,k,x,y;
int dis[1005];
long double ans[1005];
bool vis[1005];
priority_queue<pair<int,int> ,vector< pair<int,int> >,greater< pair<int,int> > > q;
priority_queue<pair<long double,int> ,vector< pair<long double,int> >,greater< pair<long double,int> > > q1;
void dijkstra1(int st){
	memset(dis,0x7f,sizeof(dis));
	dis[st] = 0;
	q.push(mk(0,st));
	while(q.size()){
		int nowx = q.top().second; q.pop();
		if(vis[nowx]) continue;
		vis[nowx] = 1;
		for(int i : edge[nowx]){
			int u = e[i].u,v = e[i].v,l = e[i].w; 
			if(dis[v] > dis[u] + l){
				dis[v] = dis[u] + l;
				q.push(mk(dis[v],v));
			}
		}
	}
}
void dijkstra2(int st){
	for(int i = 1; i <= n; i++) ans[i] = 1e12;
	memset(vis,0,sizeof(vis));
	ans[st] = 0;
	q1.push(mk(0,st));
	while(q1.size()){

		int nowx = q1.top().second; q1.pop();		printf("%d ",nowx);
		//cerr << nowx << " ";
		if(vis[nowx]) continue;
		vis[nowx] = 1;
		for(int i : edge[nowx]){
			int u = e[i].u,v = e[i].v,l = e[i].w;
			int zuo = dis[u],you = dis[u] + l;
			long double zong = 0;
			for(int j = 1; j <= k; j++){
				long double sum = 0;	
				if(t[j] <= zuo){
					sum = (long double)l * (long double)e[i].b;
				}else if(you <= t[j]){
					sum = (long double)l * (long double)e[i].a;
				}else{
					sum = (long double)(t[j] - zuo) * (long double)e[i].a + (long double)(you - t[j]) * (long double)e[i].b;
				}
				zong += sum * p[j];
			}
			if(ans[v] > ans[u] + zong){
				q1.push(mk(ans[v],v));
				ans[v] = ans[u] + zong;
			}
		}
	}
}
signed main()
{
	scanf("%lld%lld%lld%lld%lld",&n,&m,&k,&x,&y);
	long double sum = 0;
	for(int i = 1; i <= m; i++){
		scanf("%lld%lld%lld%lld%lld",&e[i].u,&e[i].v,&e[i].w,&e[i].a,&e[i].b);
		e[i+m].u = e[i].v,e[i+m].v = e[i].u,e[i+m].w = e[i].w,e[i+m].a = e[i].a,e[i+m].b = e[i].b;
		edge[e[i].u].emplace_back(i);
		edge[e[i].v].emplace_back(i+m);
	}
	for(int i = 1; i <= k; i++){
		scanf("%lld%lld",&t[i],&w[i]);
		sum += w[i];
	}
	for(int i = 1; i <= k; i++) p[i] = (long double)w[i] / sum; 
	dijkstra1(x);

	dijkstra2(x);
		//for(int i = 1; i <= n; i++) cerr << ans[i] << " " ;
	printf("%Lf\n",ans[y]);
	return 0;
}