#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;
vector<tuple<int,int,int>> g[100005];
struct Node
{
	LL d1,d2;
	int id;
	Node()=default;
	Node(LL _d1,LL _d2,int _i): d1(_d1),d2(_d2),id(_i){}
	inline Node upd(int v,int w1,int w2)
		{ return Node(d1+w1,d2+w2,v); }
	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[100005];
bool vis[100005];
priority_queue<Node,vector<Node>,greater<>> q;
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++)
		{
			g[i].clear();
			dis[i]=Node(INF,INF,i);
			vis[i]=false;
		}
		for(int i=1,u,v,w1,w2;i<=m;i++)
		{
			cin>>u>>v>>w1>>w2;
			g[u].emplace_back(v,w1,w2);
		}
		q.push(dis[1]=Node(0,0,1));
		while(!q.empty())
		{
			int u=q.top().id;
			q.pop();
			if(vis[u]) continue;
			vis[u]=true;
			for(auto &i: g[u])
			{
				int v=get<0>(i),w1=get<1>(i),w2=get<2>(i);
				Node x=dis[u].upd(v,w1,w2);
				if(!(x<dis[v])) continue;
				q.emplace(dis[v]=x);
			}
		}
		cout<<dis[n].d1<<' '<<dis[n].d2<<'\n';
	}
	return 0;
}