#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;const int N = 65;
const int M = 405;
const int inf = 0x3f3f3f3f;
int cn[N][N]; // 原图中的边
int w[M][M]; // 二分图中边的关系
int lx[M], ly[M];
char vx[M], vy[M];
int match[M];
int slack[M];
int n, m, nm;
struct Edge {int a, b, c;
}e[M];bool dfs(int p, int u, int id) {for (int i = 1; i <= n; ++i) {if (i == p) continue;if (cn[u][i] == id) return true;if (cn[u][i] != 0 && dfs(u, i, id)) {w[cn[u][i]][id-(n-1)] = max(e[cn[u][i]].c - e[id].c, 0);return true;}}return false;
}bool path(int u) {vx[u] = 1;for (int i = 1; i <= nm; ++i) {if (vy[i]) continue;if (lx[u] + ly[i] == w[u][i]) {vy[i] = 1;if (match[i] == -1 || path(match[i])) {match[i] = u;return true;}} else {slack[i] = min(slack[i], lx[u]+ly[i]-w[u][i]);}}return false;
}void KM() {memset(match, 0xff, sizeof (match));memset(ly, 0, sizeof (ly));memset(lx, 0x80, sizeof (lx));for (int i = 1; i <= nm; ++i) {for (int j = 1; j <= nm; ++j) {lx[i] = max(lx[i], w[i][j]);}}for (int i = 1; i <= nm; ++i) {int cnt = 0;while (1) {memset(slack, 0x3f, sizeof (slack));memset(vx, 0, sizeof (vx));memset(vy, 0, sizeof (vy));if (path(i)) break;int d = inf;for (int j = 1; j <= nm; ++j) if (!vy[j]) d = min(d, slack[j]);for (int j = 1; j <= nm; ++j) if (vx[j]) lx[j] -= d;for (int j = 1; j <= nm; ++j) {if (vy[j]) ly[j] += d;else slack[j] -= d;}}}
}int main() {int T, a, b, c;scanf("%d", &T);while (T--) {scanf("%d %d", &n, &m);memset(cn, 0, sizeof (cn));memset(w, 0, sizeof (w));for (int i = 1; i <= m; ++i) {scanf("%d %d %d", &a, &b, &c);if (i < n) cn[a][b] = cn[b][a] = i;e[i].a = a, e[i].b = b, e[i].c = c;}for (int i = n; i <= m; ++i) {cn[e[i].b][e[i].a] = i;dfs(0, e[i].a, i);cn[e[i].b][e[i].a] = 0;}nm = max(n-1, m-(n-1));KM();for (int i = 1; i < n; ++i) printf("%d\n", e[i].c-lx[i]);for (int i = 1; i <= m-(n-1); ++i) printf("%d\n", e[i+n-1].c+ly[i]);}return 0;
}