// Skyqwq
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

template <typename T> bool inline chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }
template <typename T> bool inline chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
	x = 0; int f = 1; char s = getchar();
	while (s > '9' || s < '0') { if (s == '-') f = -1; s = getchar(); }
	while (s <= '9' && s >= '0') x = x * 10 + s - '0', s = getchar();
	x *= f;
}

const int N = 1e3 + 5, M = 6e3 + 5;
const LL INF = 0x3f3f3f3f3f3f3f3f;

int n, m, s, t;
LL h[N], d[N];

struct E{
	int next, v, w, c;
} e[M << 1];

int head[N], numE = 1;

void add(int u, int v, int w, int c) {
	e[++numE] = (E) { head[u], v, w , c};
	head[u] = numE;
}

void addE(int u, int v, int w, int c) {
	add(u, v, w, c), add(v, u, 0, -c);
}

int pre[N];

LL incf[N];

void upd() {
	int x = t;
	while (x != s) {
		int i = pre[x];
		e[i].w -= incf[t], e[i ^ 1].w += incf[t];
		x = e[i ^ 1].v;
	}
}

typedef pair<LL, int> PLI;

priority_queue<PLI, vector<PLI>, greater<PLI> > q;

bool vis[N];



bool dij() {
	memset(d, 0x3f, sizeof d);
	memset(vis, 0, sizeof vis);
	d[s] = 0;
	q.push(mp(0, s));
	incf[s] = INF;
	while (!q.empty()) {
		int u = q.top().se; q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		for (int i = head[u]; i ; i = e[i].next) {
			int v = e[i].v;
			if (e[i].w && chkMin(d[v], d[u] + h[u] + e[i].c - h[v])) {
				q.push(mp(d[v], v));
				incf[v] = min(incf[u], (LL)e[i].w);
				pre[v] = i;
			}
		}
	}
	return d[t] != INF;
}

int Q[N];

void spfa() {
	memset(h, 0x3f, sizeof h);
	int hh = 0, tt = 1;
	Q[0] = s; h[s] = 0;
	while (hh != tt) {
		int u = Q[hh++];
		if (hh == N) hh = 0;
		vis[u] = 0;
		for (int i = head[u]; i; i = e[i].next) {
			int v = e[i].v;
			if (e[i].w) {
				
				if (h[u] + e[i].c < h[v]) {
					h[v] = h[u] + e[i].c;
					if (!vis[v]) {
						vis[v] = 1;
						Q[tt++] = v;
						if (tt == N) tt = 0;
					}
				}

			}
		}
	}
} 


int a[N];

LL ans = 0;

void addEdge(int u, int v, int L, int R, int c) {
	R -= L;
	ans += (LL)L * c;
	a[v] += L, a[u] -= L;
	addE(u, v, R, c);
}

int main() {
	read(n), read(m); int S, T; read(S), read(T);
	s = n + 1, t = n + 2;
	for (int i = 1; i <= m; i++) {
		int u, v, l, r, c; read(u), read(v), read(l), read(r), read(c);
		if (c >= 0) addEdge(u, v, l, r, c);
		else {
			a[v] += r, a[u] -= r;
			ans += 1ll * c * r;
			addE(v, u, r - l, -c);
		}
	}
	LL sm = 0;
	for (int i = 1; i <= n; i++) {
		if (a[i] > 0) addE(s, i, a[i], 0), sm += a[i];
		else addE(i, t, -a[i], 0);
	}
	addE(T, S, 1e9, 0);
	
	
	//spfa();
	while (dij()) {
		for (int i = 1; i <= n + 2; i++) h[i] += d[i];
		upd();
		ans += h[t] * incf[t];
		sm -= incf[t];
	}
	
	if (sm) {
		puts("-1");
		return 0;
	}
	
	
	LL fl = 0;
	fl = e[numE].w;
	e[numE].w = e[numE - 1].w = 0;
	s = S, t = T;
	spfa();
	
	while (dij()) {
		for (int i = 1; i <= n + 2; i++) h[i] += d[i];
		ans += h[t] * incf[t];
		fl += incf[t];
		upd();
	}
	printf("%lld %lld\n", fl, ans);
	return 0;
}