Tree Greatness

Given a tree consisting exactly of n vertices and rooted at vertex 1. Tree is a connected undirected graph with n−1 edges. Each vertex *v* of this tree has a value $a_{v}$ assigned to it. The greatness of a vertex i = (value[i] x 1) + (value[par[i]] x 2) + (value[par[par[i]] x 3) + (value[par[par[par[i]]] x 4) + ... until you reach the root i.e par[par[.....par[i]...]] is the root where par[i]