#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define int long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxm=6e5+5;
const int maxn=2e5+5;
const int mod=998244353;
inline int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}
int T;
int n,m;

int cnt,ver[maxm],nxt[maxm],head[maxn],w[maxm],val[maxm];
inline void add(int x,int y,int z,int l)
{
	cnt++;
	ver[cnt]=y;
	val[cnt]=z;
	w[cnt]=l;
	nxt[cnt]=head[x];
	head[x]=cnt;
}
const int INF=1e17;
int d[maxn];
bool bj[maxn];
inline void dijkstra(int s)
{
	rep(i,0,n) d[i]=INF;
	rep(i,0,n) bj[i]=0;
	d[s]=0;
	priority_queue<pii> q;
	q.push(mp(0,s));
	while(!q.empty())
	{
		int x=q.top().second;q.pop();
		if(bj[x]) continue;
		bj[x]=1;
		for(int i=head[x];i;i=nxt[i])
		{
			if(d[ver[i]]>d[x]+val[i])
			{
				d[ver[i]]=d[x]+val[i];
				q.push(mp(-d[ver[i]],ver[i]));
			}
		}
	}
}
bool vis[maxn];
vector<pii> e[maxn];
int in[maxn],f[maxn];
inline void init()
{
	cnt=0;
	rep(i,1,n) head[i]=0,e[i].clear(),vis[i]=0;
	rep(i,1,n) f[i]=-INF;
	f[1]=0;
}
inline int dfs(int x)
{
	if(vis[x]) return f[x];
	vis[x]=1;
	for(auto pr:e[x])
	{
		auto y=pr.fi,v=pr.se;
		f[x]=max(f[x],v+dfs(y));
	}
	return f[x];
}
signed main()
{
	T=read();
	while(T--)
	{
		n=read(),m=read();
		init();
		rep(i,1,m)
		{
			int x=read(),y=read(),u=read(),v=read();
			add(x,y,u,v);	
		}	
		dijkstra(1);
		rep(x,1,n)
		{
			for(int i=head[x];i;i=nxt[i])
			{
				if(d[ver[i]]==d[x]+val[i]) 
				{
					e[ver[i]].push_back(mp(x,w[i]));
				}
			}
		}
		f[n]=dfs(n);
		printf("%lld %lld\n",d[n],f[n]);
	}
}