given — integer N number of nodes<br>↵
2D array of size (N-1)*2<br>↵
undirected graph<br>↵
↵
edges of unweighted tree<br>↵
no cycles<br>↵
for each node determine number of paths containing node.<br>↵
example for graph with edges 1-2 and 2-3<br>↵
↵
all paths — (1,2),(1,2,3),(2,3),(3,2),(3,2,1),(2,1)<br>↵
node 1-4 times<br>↵
node 2-6 times<br>↵
node 3-4 times<br>↵
↵
so output is 4 6 4<br>↵
↵
Input format<br>↵
1st line-no of testcases<br>↵
2nd line -no of nodes(N)<br>↵
next N lines 2 integers denoting source and destination vertex<br>↵
↵
Sample input<br>↵
2<br>↵
3<br>↵
1 2<br>↵
2 3<br>↵
2<br>↵
1 2<br>↵
↵
sample output<br>↵
4 6 4<br>↵
2 2<br>↵
↵
function<br>↵
def count_paths(N,edges)<br>
2D array of size (N-1)*2<br>↵
edges of unweighted tree<br>↵
no cycles<br>↵
for each node determine number of paths containing node.<br>↵
example for graph with edges 1-2 and 2-3<br>↵
↵
all paths — (1,2),(1,2,3),(2,3),(3,2),(3,2,1),(2,1)<br>↵
node 1-4 times<br>↵
node 2-6 times<br>↵
node 3-4 times<br>↵
↵
so output is 4 6 4<br>↵
↵
Input format<br>↵
1st line-no of testcases<br>↵
2nd line -no of nodes(N)<br>↵
next N lines 2 integers denoting source and destination vertex<br>↵
↵
Sample input<br>↵
2<br>↵
3<br>↵
1 2<br>↵
2 3<br>↵
2<br>↵
1 2<br>↵
↵
sample output<br>↵
4 6 4<br>↵
2 2<br>↵
↵
function<br>↵
def count_paths(N,edges)<br>
