#include <bits/stdc++.h>
#define int long long
#define inf 0x3f3f3f3f
#define re register
#define N 301200
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
struct edge{
	int to;pii dis;int next;
	friend bool operator <(edge a,edge b){
		return a.dis>b.dis;
	}
}e[N<<1];
inline int read(){
	int x=0,w=0;char ch=getchar();
	while (!isdigit(ch))w|=ch=='-',ch=getchar();
	while (isdigit(ch))x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return w?-x:x;
}
priority_queue<edge>q;
int n,m,s,vis[N],cnt,head[N];
pii dis[N];
void add(int u,int v,int d,int w){
	e[++cnt].to=v;
	e[cnt].dis={d,-w};
	e[cnt].next=head[u];
	head[u]=cnt;
}
pii operator +(pii a,pii b){
	return {a.fi+b.fi,a.se+b.se};
}
void dij(){
	for (int i=1;i<=n;++i)dis[i]={inf,0},vis[i]=0;
	dis[1]={0,0};
	q.push((edge){1,{0,0}});
	while (!q.empty()){
		int u=q.top().to;q.pop();
		if(vis[u])continue;
		vis[u]=1;
		for (int i=head[u];i;i=e[i].next){
			int v=e[i].to;
			if (dis[v]>dis[u]+e[i].dis){
				dis[v]=dis[u]+e[i].dis;
				if (!vis[v])q.push((edge){v,dis[v]});
			}
		}
	}
}
void solve(){
	n=read(),m=read();
	cnt=0;
	for (int i=1;i<=n;++i)head[i]=0;
	for (int i=1;i<=m;++i){
		int u=read(),v=read(),d=read(),w=read();
		add(u,v,d,w);
	}
	dij();
	printf("%lld %lld\n",dis[n].fi,-dis[n].se); 
}
signed main(){
	int T=read();
	while (T--)solve();
	return 0;
}