#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 10;
const int p = 1e9 + 7;
int n, m;
struct Info {
    int wei, num;
};
Info Merge(Info u, Info v) {
    return {u.wei + v.wei, (int)(1ll * u.num * v.num % p)};
}
Info Max(Info u, Info v) {
    if (v.wei == u.wei) return {u.wei, (u.num + v.num) % p};
    return (u.wei > v.wei ? u : v);
}
struct Edge {
    Info f[2][2];
    Edge() {
        f[0][1] = f[1][0] = f[0][0] = f[1][1] = {(int)-1e9, 0};
    }
    Edge(int x, int y, int z) {
        f[0][0] = {0, 1};
        f[0][1] = f[1][0] = {(int)-1e9, 0};
        f[1][1] = {z, 1};
    }
};
map<int, Edge> g[N];
Edge Par(Edge u, Edge v) {
    Edge ans;
    for (int i = 0; i < 2; ++i)
        for (int j = 0; j < 2; ++j)
            for (int k = 0; k < 2; ++k) if (i + k <= 1)
                for (int l = 0; l < 2; ++l) if (j + l <= 1) {
                    ans.f[i + k][j + l] = Max(ans.f[i + k][j + l], Merge(u.f[i][j], v.f[k][l]));
                }
    return ans;
}
Edge Ser(Edge u, Edge v) {
    Edge ans;
    for (int i = 0; i < 2; ++i)
        for (int j = 0; j < 2; ++j)
            for (int k = 0; k < 2; ++k) if (j + k <= 1)
                for (int l = 0; l < 2; ++l) {
                    ans.f[i][l] = Max(ans.f[i][l], Merge(u.f[i][j], v.f[k][l]));
                }
    return ans;
}
Edge Flip(Edge u) {
    Edge ans;
    for (int i = 0; i < 2; ++i) 
        for (int j = 0; j < 2; ++j) 
        ans.f[i][j] = u.f[j][i];
    return ans;
}
inline void Adde(int x, int y, Edge z) {
    auto it = g[x].lower_bound(y);
    if (it == g[x].end() || it->first != y) g[x].insert(it, {y, z});
    else it->second = Par(it->second, z);
}
signed main() {
    int Case;
    scanf("%lld", &Case);
    while (Case--) {
        scanf("%lld%lld", &n, &m);
        for (int i = 1, x, y, z; i <= m; ++i) {
            scanf("%lld%lld%lld", &x, &y, &z);
            Adde(x, y, Edge(x, y, z));
            Adde(y, x, Edge(y, x, z));
        }
        queue<int> q;
        for (int i = 1; i <= n; ++i) if (g[i].size() == 2) q.push(i);
        while (!q.empty()) {
            int u = q.front(); q.pop();
            if (g[u].size() != 2) continue;
            auto [x, ex] = *g[u].begin();
            auto [y, ey] = *--g[u].end();
            g[x].erase(u);
            g[y].erase(u);
            g[u].clear();
            Adde(x, y, Ser(Flip(ex), ey));
            Adde(y, x, Ser(Flip(ey), ex));
            if (g[x].size() == 2) q.push(x);
            if (g[y].size() == 2) q.push(y);
        }
        for (int i = 1; i <= n; ++i) if (g[i].size()) {
            auto [y, ey] = *g[i].begin();
            Info ans({(int)-1e9, 0});
            // printf("- %lld %lld\n", i, y);
            for (int i = 0; i < 2; ++i)
                for (int j = 0; j < 2; ++j)
                ans = Max(ans, ey.f[i][j]);
            printf("%lld %lld\n", ans.wei, ans.num);
            break;
        }
        for (int i = 1; i <= n; ++i) g[i].clear();
    }
    return 0;
}