Score of a Tree
You are given a tree of $$$n$$$ nodes, rooted at $$$1$$$. Every node has a value of either $$$0$$$ or $$$1$$$ at time $$$t=0$$$.At any integer time $$$t>0$$$, the value of a node becomes the bitwise XOR of the values of its children at time $$$t - 1$$$; the values of leaves become $$$0$$$ since they don't have any children.Let $$$S(t)$$$ denote the sum of values of all nodes at time $$$t$$$. Let $$$F(A)$$$ denote the sum of $$$S(t)$$$ across all values of $$$t$$$ such that $$$0 \le t \le 10^{100}$$$, where $$$A$$$ is the initial assignment of $$$0$$$s and $$$1$$$s in the tree.The task is to find the sum of $$$F(A)$$$ for all $$$2^n$$$ initial configurations of $$$0$$$s and $$$1$$$s in the tree. Print the sum modulo $$$10^9+7$$$.
Let us find $$$F(A)$$$ for the configuration $$$A = [0,1,0,0,1,1]$$$ ($$$A[i]$$$ denotes the value of node $$$i$$$). Initially (at $$$t = 0$$$) our tree is as shown in the picture below. In each node, two values are shown: the number and the value of this node. $$$S(0)$$$ for this configuration is $$$3$$$.   At $$$t = 1$$$ the configuration changes to $$$[1,0,0,0,0,0]$$$. The tree looks as shown below. $$$S(1) = 1$$$.   At $$$t = 2$$$ the configuration changes to $$$[0,0,0,0,0,0]$$$. The tree looks as shown below. $$$S(2) = 0$$$.   For all $$$t>2$$$, the graph remains unchanged, so $$$S(t)=0$$$ for all $$$t > 2$$$. So, for the initial configuration $$$A = [0,1,0,0,1,1]$$$, the value of $$$F(A) = 3 + 1 = 4$$$.Doing this process for all possible $$$2^{6}$$$ configurations yields us an answer of $$$\textbf{288}$$$. 
Each test contains multiple test cases. The first line contains the number of test cases $$$t$$$ ($$$1 \le t \le 10^5$$$). The description of the test cases follows.The first line of each test case contains $$$n$$$ ($$$1 \le n \le 2 \cdot 10^5$$$) — the number of nodes in the tree.The next $$$n-1$$$ lines of each test case contain two integers each — $$$u$$$, $$$v$$$ indicating an edge between $$$u$$$ and $$$v$$$ ($$$1 \le u, v \le n$$$).It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.
Output the sum modulo $$$10^9+7$$$ for each test case.
import sys
input = sys.stdin.readline

def readList():
    return list(map(int, input().split()))

def readInt():
    return int(input())

def readInts():
    return map(int, input().split())

def readStr():
    return input().strip()

def solve():
    n = readInt()
    m = 10 ** 9 + 7
    graph = [[] for _ in range(n + 1)]
    for _ in range(n - 1):
        (u, v) = readInts()
        graph[v].append(u)
        graph[u].append(v)
    st = [1]
    par = {1: -1}
    vis = [False] * (n + 1)
    d = [0] * (n + 1)
    while st:
        node = st[-1]
        if vis[node]:
            v = st.pop()
            if node == 1:
                continue
            d[par[v]] = max(d[par[v]], d[v] + 1)
            continue
        vis[node] = True
        for nei in graph[node]:
            if nei in par:
                continue
            par[nei] = node
            st.append(nei)
    return 2 ** (n - 1) * (sum(d) + n) % m
for _ in range(int(input())):
    print(solve())
from collections import defaultdict
MOD = 10 ** 9 + 7

def dfs(graph, depth):
    stack = [(1, -1, True)]
    while stack:
        (node, parent, first_visit) = stack.pop()
        if first_visit:
            stack.append((node, parent, False))
            for neighbor in graph[node]:
                if neighbor != parent:
                    stack.append((neighbor, node, True))
        elif parent != -1:
            depth[parent] = max(depth[parent], depth[node] + 1)

def solve():
    n = int(input())
    graph = defaultdict(list)
    for _ in range(n - 1):
        (a, b) = map(int, input().split())
        graph[a].append(b)
        graph[b].append(a)
    depth = [1] * (n + 1)
    dfs(graph, depth)
    res = sum(depth[1:])
    print(res * pow(2, n - 1, MOD) % MOD)
for _ in range(int(input())):
    solve()
from collections import defaultdict
MOD = 10 ** 9 + 7

def DFS(nums, depth):
    stack = [(1, -1, True)]
    while stack:
        (node1, p, first_visit) = stack.pop()
        if first_visit:
            stack.append((node1, p, False))
            for ne in nums[node1]:
                if ne != p:
                    stack.append((ne, node1, True))
        elif p != -1:
            depth[p] = max(depth[p], depth[node1] + 1)

def mani():
    n = int(input())
    nums = defaultdict(list)
    for _ in range(n - 1):
        (a, b) = map(int, input().split())
        nums[a].append(b)
        nums[b].append(a)
    depth = [1] * (n + 1)
    DFS(nums, depth)
    res = sum(depth[1:])
    print(res * pow(2, n - 1, MOD) % MOD)
for _ in range(int(input())):
    mani()
for i in range(30):
    continue