The MEX of a set of integers is defined as the smallest non-negative integer that does not belong to this set. For example, $\mathrm{MEX}(\{0,2,3\}) = 1$ and $\mathrm{MEX}(\{1,3\}) = 0$.
Chef has a tree with $N$ nodes (numbered $1$ through $N$). The tree is rooted at node $1$. Chef wants to assign a non-negative integer to each node in such a way that each integer between $0$ and $N-1$ (inclusive) is assigned to exactly one node.
For each node $u$, consider the integers assigned to the nodes in the subtree of $u$ (including $u$); let $a_u$ denote the MEX of these integers. Chef wants $a_1 + a_2 + \ldots + a_N$ to be as large as possible. Find the maximum possible value of this sum.

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains a single integer $N$.
- The second line contains $N-1$ space-separated integers $p_1, p_2, \ldots, p_{N-1}$. For each valid $i$, the node $p_i$ is the parent of the node $i+1$.

-----Output-----
For each test case, print a single line containing one integer ― the maximum sum of subtree MEX-s which can be obtained if you assign the weights optimally.

-----Constraints-----
- $1 \le T \le 5$
- $2 \le N \le 10^5$
- $1 \le p_i < i$ for each valid $i$

-----Subtasks-----
Subtask #1 (100 points): original constraints

-----Example Input-----
2
3
1 1
5
1 1 2 2

-----Example Output-----
4
9

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'from sys import setrecursionlimit\r\nsetrecursionlimit(10**6)\r\nclass Graph:\r\n    def __init__(self,V):\r\n        self.graph=[[] for i in range(V+1)]\r\n        self.Visited=set()\r\n        self.height=1\r\n        \r\n    def addEdges(self):\r\n        arr=[int(x) for x in input().split()]\r\n        for i in range(len(arr)):\r\n            self.graph[i+1].append(arr[i]-1)\r\n            self.graph[arr[i]-1].append(i+1)\r\n            \r\n    def DFS(self,Node):\r\n        self.Visited.add(Node)\r\n        if len(self.graph[Node]) == 0:\r\n            return 1,1\r\n        node=1\r\n        mex=1\r\n        for each in self.graph[Node]:\r\n            if each not in self.Visited:\r\n                n1,m1=self.DFS(each)\r\n                node+=n1\r\n                mex=max(m1,mex)\r\n            \r\n        return node,mex+node\r\n        \r\nfor _ in range(int(input())):\r\n    V=int(input())\r\n    gra=Graph(V)\r\n    gra.addEdges()\r\n    #print(gra.graph)\r\n    x,y=gra.DFS(0)\r\n    print(y-1)\r\n    #print(height*height)\r\n    #print((gra.height*(gra.height+1))//2)\r\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 16177