#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
struct MinCostFlow{
	static constexpr ll Inf=numeric_limits<ll>::max();
	const int n;
	struct Edge{
		int v;
		ll w,c;
	};
	vector<Edge> e;
	vector<vector<int>> g;
	MinCostFlow(int n):n(n),g(n){}
	void add_edge(int u,int v,ll w,ll c){
		g[u].push_back(e.size());
		e.push_back({v,w,c});
		g[v].push_back(e.size());
		e.push_back({u,0,-c});
	}
	vector<int> pre,in;
	vector<ll> dis,aug;
	bool bfs(int s,int t){
		pre.assign(n,0);
		dis.assign(n,Inf);
		aug.assign(n,0);
		in.assign(n,0);
		queue<int> q;
		dis[s]=0;
		aug[s]=Inf;
		in[s]=1;
		q.push(s);
		while(q.size()){
			int u=q.front();
			q.pop();
			in[u]=0;
			for(int i:g[u]){
				auto [v,w,c]=e[i];
				if(w&&dis[v]>dis[u]+c){
					dis[v]=dis[u]+c;
					pre[v]=i;
					aug[v]=min(aug[u],w);
					if(!in[v]){
						in[v]=1;
						q.push(v);
					}
				}
			}
		}
		return dis[t]<Inf;
	}
	pair<ll,ll> flow(int s,int t){
		ll res1=0,res2=0;
		while(bfs(s,t)){
			res1+=aug[t];
			for(int u=t;u!=s;u=e[pre[u]^1].v){
				res2+=aug[t]*e[pre[u]].c;
				e[pre[u]].w-=aug[t];
				e[pre[u]^1].w+=aug[t];
			}
		}
		return {res1,res2};
	}
};
struct UpDownFlow{
	const int n;
	MinCostFlow f;
	vector<ll> F;
	ll cost;
	UpDownFlow(int n):n(n),f(n+2),F(n),cost(0){}
	void add_edge(int u,int v,ll l,ll r,ll c){
		if(c>=0){
			f.add_edge(u,v,r-l,c);
		}else{
			f.add_edge(v,u,r-l,-c);
			cost+=c*(r-l);
			F[u]+=r-l;
			F[v]-=r-l;
		}
		F[u]+=l;
		F[v]-=l;
		cost+=c*l;
	}
	pair<ll,ll> flow(int s,int t){
		int S=n,T=n+1;
		ll sum=0;
		For(i,0,n-1){
			if(F[i]>=0){
				f.add_edge(i,T,F[i],0);
				sum+=F[i];
			}else{
				f.add_edge(S,i,-F[i],0);
			}
		}
		f.add_edge(t,s,f.Inf,0);
		auto [r1,r2]=f.flow(S,T);
		if(r1!=sum){
			return {-1,0};
		}
		auto [R1,R2]=f.flow(s,t);
		return {R1,r2+R2+cost};
	}
};
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n,m,s,t;
	cin>>n>>m>>s>>t;
	UpDownFlow f(n+1);
	For(i,1,m){
		int u,v,l,r,c;
		cin>>u>>v>>l>>r>>c;
		f.add_edge(u,v,l,r,c);
	}
	auto [r1,r2]=f.flow(s,t);
	if(!~r1){
		cout<<"-1\n";
	}else{
		cout<<r1<<' '<<r2<<'\n';
	}
	return 0;
}