#include<bits/stdc++.h>

#define endl '\n'
#define pii pair<int, int>
#define int long long

using namespace std;

const int N=100010;

int n,m;

struct node{
    int v,e,p;
};

vector<node>g[N];

int dis1[N],dis2[N];

void dijkstra(){
    priority_queue<pii,vector<pii>,greater<pii>>q;
    for(int i=2;i<=n;i++){
        dis1[i]=1e18;
        dis2[i]=-1e18;
    }

    vector<int>vis(n+1,0);

    q.push({0,1});
    while(q.size()){
        auto [dis,u]=q.top();
        q.pop();
        if(vis[u])continue;
        vis[u]=1;
        for(auto [v,e,p]:g[u]){
            if(dis1[v]>dis1[u]+e){
                dis1[v]=dis1[u]+e;
                dis2[v]=dis2[u]+p;
                q.push({dis1[v],v});
            } else if(dis1[v]==dis1[u]+e&&dis2[v]<dis2[u]+p){
                dis2[v]=dis2[u]+p;
                q.push({dis1[v],v});
            }
        }
    }
}

void solve(){
    cin>>n>>m;

    for(int i=1;i<=n;i++){
        g[i].clear();
    }

    for(int i=1;i<=m;i++){
        int u,v,e,p;
        cin>>u>>v>>e>>p;
        g[u].push_back({v,e,p});
    }

    dijkstra();

    cout<<dis1[n]<<' '<<dis2[n]<<endl;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin>>t;

    while(t--){
        solve();
    }

    
    return 0;
}