//#pragma GCC optimize("O3")
#include<bits/stdc++.h>

using namespace std;

typedef int ll;

void solve() {
	ll n, m;
	cin >> n >> m;
	vector<vector<ll>> all(n);
	vector<ll> mp(n, 0), gp(n, 0), cm(n, 0), cg(n, 0);
	vector<ll> cma(m);
	for (ll i = 0; i < m; i++) {
		cin >> cma[i];
	}
	for (ll i = 0; i < m; i++) {
		vector<bool> used(n, false);
		for (ll j = 0; j < cma[i]; j++) {
			ll a, b, w1, w2, d;
			cin >> a >> b >> w1 >> w2 >> d;
			a--;
			b--;
			used[a] = true;
			used[b] = true;
			if (w1 == 2) {
				mp[a] += 3;
			}
			if (w2 == 2) {
				mp[b] += 3;
			}
			if (w1 == w2) {
				mp[a]++;
				mp[b]++;
			}
			gp[a] += w1 * 3 + d;
			gp[b] += w2 * 3 + d;
			cg[a] += w1 + w2 + d;
			cg[b] += w1 + w2 + d;
			all[a].push_back(b);
			all[b].push_back(a);
		}
		for (ll j = 0; j < n; j++) {
			cm[j]++;
			if (!used[j]) {
				cg[j] += 2;
				gp[j] += 6;
				mp[j] += 3;
			}
		}
		cout << "Round " << i + 1 << '\n';
		for (ll j = 0; j < n; j++) {
			cout << mp[j] << ' ';
			ll col = 0, nu = 0, nd = 1;
			for (auto k : all[j]) {
				col++;
				ll nowu = mp[k], nowd = cm[k] * 3;
				if (nowu * 3 < nowd) {
					nowu = 1;
					nowd = 3;
				}
				ll x = nd * nowd / gcd(nd, nowd);
				nu *= x / nd;
				nd = x;
				nu += nowu * (x / nowd);
			}
			if (col == 0) {
				cout << "1/3" << ' ';
			} else {
				nd *= col;
				ll x = gcd(nu, nd);
				cout << nu / x << '/' << nd / x << ' ';
			}
			if (gp[j] * 3 < cg[j] * 3) {
				cout << "1/3" << ' ';
			} else {
				ll x = gcd(cg[j] * 3, gp[j]);
				cout << gp[j] / x << '/' << cg[j] * 3 / x << ' ';
			}
			col = 0;
			nu = 0;
			nd = 1;
			for (auto k : all[j]) {
				col++;
				ll nowu = gp[k], nowd = cg[k] * 3;
				if (nowu * 3 < nowd) {
					nowu = 1;
					nowd = 3;
				}
				ll x = nd * nowd / gcd(nd, nowd);
				nu *= x / nd;
				nd = x;
				nu += nowu * (x / nowd);
			}
			if (col == 0) {
				cout << "1/3" << ' ';
			} else {
				nd *= col;
				ll x = gcd(nu, nd);
				cout << nu / x << '/' << nd / x << ' ';
			}
			cout << '\n';
		}
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ll t;
	cin >> t;
	while (t--) {
		solve();
	}
}