#include <bits/stdc++.h>
using namespace std;

using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;
using I128=__int128;
using U128=unsigned __int128;
constexpr LL INF=4e18;

int T,n,m;
struct Node
{
	LL d1,d2;
	Node()=default;
	Node(LL _d1,LL _d2): d1(_d1),d2(_d2){}
	inline Node operator +(const Node &rhs)const
		{ return Node(d1+rhs.d1,d2+rhs.d2); }
	inline bool operator <(const Node &rhs)const
		{ return d1!=rhs.d1?d1<rhs.d1:d2>rhs.d2; }
	inline bool operator >(const Node &rhs)const
		{ return rhs<*this; }
}dis[1005][1005];
int main()
{
	ios::sync_with_stdio(false);
//	cin.tie(nullptr),cout.tie(nullptr);
	cin>>T;
	while(T--)
	{
		cin>>n>>m;
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				dis[i][j]=((i==j)?Node(0,0):Node(INF,-INF));
		for(int i=1,u,v,w1,w2;i<=m;i++)
			cin>>u>>v>>w1>>w2,dis[u][v]=min(dis[u][v],Node(w1,w2));
		for(int i=1;i<=n;i++)
			for(int j=1;j<=n;j++)
				for(int k=1;k<=n;k++)
					dis[j][k]=min(dis[j][k],dis[j][i]+dis[i][k]);
		cout<<dis[1][n].d1<<' '<<(dis[1][n].d2<0?-INF:dis[1][n].d2)<<'\n';
	}
	return 0;
}