Problem - Company Queries I

You are given a tree representing a company hierarchy. Each employee has a boss (parent), except the CEO (root). Given $q$ queries of the form $(v, k)$, find the $k$-th boss of employee $v$.

If $v$ does not have a $k$-th boss (if $k$ exceeds the depth), return $-1$. This is the classic $k$-th ancestor problem. Binary lifting solves it perfectly. Build the $up$ table once, then answer each query in $O(\log n)$ time.