#ifdef DEBUG
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

//const ll mod = 1000000007;
const ll mod = 998244353;

#define X first
#define Y second

ll pew(ll a, ll b)
{
    ll res = 1;
    while (b>0)
    {
        if (b&1) res = res*a%mod;
        b >>= 1;
        a = a*a%mod;
    }
    return res;
}



void solve()
{
    ll n, m;
    cin >> n >> m;
    vector<vector<pair<ll,ll>>> g(n);
    for (ll i=0;i<m;i++)
    {
        ll u, v, c;
        cin >> u >> v >> c;
        u--, v--;
        g[u].push_back({v,c});
    }
    ll mn = mod*mod, C = 0;
    for (int i=0;i<n;i++)
    {
        vector<ll> d(n,mod*mod), cnt(n);
        for (int j=0;j<g[i].size();j++)
        {
            int v = g[i][j].X, c = g[i][j].Y;
            if (v>=i) d[v] = c, cnt[v] = 1;
        }
        vector<int> was(n);
        for (int w=0;w<n-i;w++)
        {
            int p = -1;
            for (int u=i;u<n;u++)
            {
                if (was[u]==1) continue;
                if (p==-1 or d[u]<d[p]) p = u;
            }
            was[p] = 1;
            if (p==i)
            {
                if (d[i]==mod*mod) continue;
                if (mn>d[i]) mn = d[i], C = 0;
                if (d[i]==mn) C = (C+cnt[i])%mod;
            }
            for (int j=0;j<g[p].size();j++)
            {
                int v = g[p][j].X;
                if (v<i) continue;
                ll D = d[p]+g[p][j].Y;
                if (d[v]>D)
                {
                    d[v] = D, cnt[v] = 0;
                }
                if (d[v]==D) cnt[v] = (cnt[v]+cnt[p])%mod;
            }
        }
    }
    if (mn==mod*mod) cout << -1 << " " << -1 << "\n";
    else cout << mn << " " << C << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//#ifdef DEBUG
    //freopen("input.txt", "r", stdin);
//#endif
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}