#define _CRT_SECURE_NO_WARNINGS

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 const int MAXN = ( + );

 struct Edge {

     int v, w, next;

 }edge[MAXN << ];

 int n, ans, NE, End, maxlen;

 int head[MAXN];

 void Insert(int u, int v, int w)

 {

     edge[NE].v = v;

     edge[NE].w = w;

     edge[NE].next = head[u];

     head[u] = NE++;

 }

 int dp[MAXN];

 void dfs(int u, int father, int len)

 {

     if (len > maxlen) {

         maxlen = len;

         End = u;

     }

     for (int i = head[u]; i != -; i = edge[i].next) {

         int v = edge[i].v;

         int w = edge[i].w;

         if (v == father) continue;

         dfs(v, u, len + w);

         dp[v] = max(dp[v], len + w);

     }

 }

 int main()

 {

     int _case, t = ;

     scanf("%d", &_case);

     while (_case--) {

         scanf("%d", &n);

         NE = ;

         memset(head, -, sizeof(head));

         for (int i = ; i < n; i++) {

             int u, v, w;

             scanf("%d %d %d", &u, &v, &w);

             Insert(u, v, w);

             Insert(v, u, w);

         }

         maxlen = ;

         memset(dp, , sizeof(dp));

         dfs(, -, );

         dfs(End, -, );

         dfs(End, -, );

         printf("Case %d:\n", t++);

         for (int i = ; i < n; i++) {

             printf("%d\n", dp[i]);

         }

     }

     return ;

 }