little penguin Polo get tree nondirecte connected acyclic graph contain n node n1 edge we consider tree node number integer 1 nToday Polo wonder find number pair path do not common node more formally find number group integer abc d 1abn 1cdn there s node lie short path node node b node c node d the short path betweem node path short number edgeshelp Polo solve problem