EAGLE1  Eagle and Dogs
Eagle (AKA Mohamed Ahmed) lives in a city consists of n intersections connected by n1 roads, in a way that can go from any intersection to any other intersection moving along some of these roads.
Every day he starts walking in the city following a simple strategy; if he's at some intersection he has to pick one of the roads connected to it at random such that he hasn't walked through it before and walk through it and and if there isn't any, he stops and goes home.
His only problem is that he's afraid of dogs. He doesn't even like seeing dogs. So he's wondering in the worst scenario, how many dogs he'll have to see during his walk until he stops if he starts walking at some intersection. Can you help him?
Input
The input starts with an integer T (1 <= T <= 10), the number of test cases. following T blocks describing each test case.
Each block starts with a line containing an integer n (2 <= n <= 10^{5}), the number of intersections in the city. Intersections are numbers 1 through n.
Followed by n1 lines each containing integers u, v, (1 <= u, v <= n) and d (1 <= d <= 10^{9}), the numbers of intersections at the end of this road and the number od dogs Eagle will see walking in this road.
Output
For each test case print a line containing n integers, the ith integer represents the maximum number of dogs Eagle might see if he starts his walk at intersection i.
Example
Input: 1
4
1 2 3
3 2 4
3 4 5 Output: 12 9 7 12
hide comments
demon_coder123:
20230529 12:52:36
can anyone please post a link for the explanation of this problem solution using dp PLEASE. 

nahid_180103:
20230504 21:41:41
I call dfs for 4 times....But AC!!! 

amit_20je0117:
20221028 21:44:41
Rerooting technique for DP on trees !!


sankalp_7:
20221017 20:07:16
Nice "DP on trees" question ;) 

l3vel:
20220123 05:54:15
For all those getting TLE, You will have to use dp along with dfs approach


hsn_kei:
20211125 04:45:41
you can call dfs 5 or 6 time


teslum_369:
20211023 15:02:48
You can use the DFS three times.


princemishra:
20210626 07:23:04
dp on trees question


cryp_bipul17:
20210511 07:41:23
I am trying to run two dfs one from the beginning and another from end and counting the number of dogs in each node and finding the maximum of the two dfs but getting WA can anyone please tell is my approach correct


sshubham_26:
20210428 17:05:09
i have called dfs two times only 
Added by:  eagle93 
Date:  20150617 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 JSMONKEY 