// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
namespace Dinic
{
    uint To[60005],Last[60005],End[1005],Cur[1005],n,tp;
    ullt Flow[60005];llt Cost[60005],Dist[1005];bol Init[60005];
    voi build(uint n){Dinic::n=n,tp=0;for(uint i=0;i<n;i++)End[i]=-1;}
    voi insert(uint u,uint v,ullt f,llt c)
    {
        To[tp]=v,Last[tp]=End[u],Flow[tp]=f,Cost[tp]=c,End[u]=tp++;
        To[tp]=u,Last[tp]=End[v],Flow[tp]=0,Cost[tp]=-c,End[v]=tp++;
    }
    bol bfs(uint p,uint t)
    {
        for(uint i=0;i<n;i++)Dist[i]=1e18,Cur[i]=End[i];
        Dist[p]=0;std::queue<uint>Q;Q.push(p),Init[p]=true;
        while(Q.size())
        {
            p=Q.front(),Q.pop(),Init[p]=false;
            for(uint e=End[p];~e;e=Last[e])
                if(Flow[e]&&_min(Dist[To[e]],Dist[p]+Cost[e])&&!Init[To[e]])
                    Q.push(To[e]),Init[To[e]]=true;
        }
        return Dist[t]<1e16;
    }
    ullt dfs(uint p,uint t,ullt f)
    {
        if(p==t)return f;
        if(Init[p])return 0;
        ullt ans=0;Init[p]=true;
        for(uint&e=Cur[p];~e;e=Last[e])if(Flow[e]&&Dist[To[e]]==Dist[p]+Cost[e])
        {
            ullt g=dfs(To[e],t,std::min(f,Flow[e]));
            f-=g,ans+=g,Flow[e]-=g,Flow[e^1]+=g;
            if(!f)return Init[p]=false,ans;
        }
        return Init[p]=false,ans;
    }
    std::pair<ullt,llt>run(uint p,uint t)
    {
        ullt ans=0,user;llt c=0;
        while(bfs(p,t))ans+=user=dfs(p,t,-1llu),c+=(llt)user*Dist[t];
        return{ans,c};
    }
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
	uint n,m,s,t;scanf("%u%u%u%u",&n,&m,&s,&t),s--,t--,Dinic::build(n+2),Dinic::insert(t,s,1e10,0);
	llt ans=0;
	while(m--)
	{
		uint s,t,l,r;llt w;scanf("%u%u%u%u%lld",&s,&t,&l,&r,&w),s--,t--;
		if(w<0)Dinic::insert(t,s,r-l,-w),Dinic::insert(n,t,r,0),Dinic::insert(s,n+1,r,0),ans+=r*w;
		else Dinic::insert(s,t,r-l,w),Dinic::insert(n,t,l,0),Dinic::insert(s,n+1,l,0),ans+=l*w;
	}
	ans+=Dinic::run(n,n+1).second;
	for(uint&e=Dinic::End[n];~e;e=Dinic::Last[e])if(Dinic::Flow[e])return puts("-1"),0;else Dinic::Flow[e^1]=0;
	auto g=Dinic::run(s,t);
	ans+=g.second;
	printf("%llu %lld\n",g.first,ans);
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。