#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

typedef long long LL;
typedef pair <LL, int> PII;

constexpr double EPS = 1e-8;
const double PI = acos(-1);

int multi_cases = 1;

constexpr LL inf = 1e18;
void A_SOUL_AvA () {
    int n, m;
    cin >> n >> m;
    
    vector <array<int, 3>> e[n + 1];
    for (int i = 0, u, v, w, c; i < m; i++) {
        cin >> u >> v >> w >> c;
        e[u].pb({v, w, c});
    }
    
    vector <array<int, 3>> graph[n + 1];
    auto dij = [&]() -> LL {
        vector <LL> dis(n + 1, inf);
        vector <int> vis(n + 1, 0);
        dis[1] = 0;
        priority_queue <PII, vector<PII>, greater<>> q;
        q.push({0, 1});
        
        while (q.size()) {
            auto [d, u] = q.top();
            q.pop();
            if (vis[u]) continue;
            vis[u] = 1;
            for (auto &[v, e, p] : e[u]) {
                if (dis[v] > d + e) {
                    dis[v] = d + e;
                    q.push({dis[v], v});
                }
            }
        }
        for (int i = 1; i <= n; i++) {
            if (dis[i] == inf) continue;
            for (auto &[j, e, p] : e[i]) {
                if (dis[j] == dis[i] + e) {
                    graph[i].push_back({j, e, p});
                }
            }
        }
        return dis[n];
    };
    
    auto min_energy = dij();
    
    vector <int> dfn(n + 1), low(n + 1), stk(n + 5), st(n + 5);
    vector <int> id(n + 5);
    int now = 0, scc_cnt = 0, top = 0;

    function <void(int)> tarjan = [&](int u) -> void {
        dfn[u] = low[u] = ++now;
        stk[++top] = u, st[u] = 1;
        for (auto &[v, e, p] : graph[u]) {
            if (!dfn[v]) {
                tarjan(v);
                low[u] = min(low[u], low[v]);
            } else if (st[v]) {
                low[u] = min(low[u], dfn[v]);
            }
        }
        if (dfn[u] == low[u]) {
            int y = 0;
            scc_cnt++;
            do {
                y = stk[top--];
                st[y] = 0;
                id[y] = scc_cnt;
            } while (y != u);
        }
    };

    for (int i = 1; i <= n; i++) {
        if (!dfn[i]) tarjan(i);
    }
    
    vector <array<int, 3>> adj[scc_cnt + 1];
    vector <LL> f(n + 5);
    for (int i = 1; i <= n; i++) {
        for (auto &[j, e, p] : graph[i]) {
            int u = id[i], v = id[j];
            if (u != v) {
                adj[u].push_back({v, e, p});
            } else {
                f[u] += p;
            }
        }
    }

    for (int i = id[1]; i >= 1; i--) {
        for (auto &[j, e, p] : adj[i]) {
            f[j] = max(f[j], f[i] + p);
        }
    }
    cout << min_energy << " " << f[id[n]] << "\n";
}

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int T = 1;
    for (multi_cases && cin >> T; T; T--) {
        A_SOUL_AvA ();
    }

    return 0;
}