**Given $N$ cities connected by $N-1$ bidirectional roads i.e they form a tree . Cities with odd numbers are cities of Jack and even numbers cities belong to Bob. Each city has some initial popularity given by array Popularity. Now there are $Q$ tours taken by some tourists from city u to v taking the simple path.**↵
↵
**As they travel from city u to v , the popularity of cities in between increases by x units.**↵
**Let $P1$ and $P2$ be the sum of popularities of the cities of Jack and Bob after $Q$ tours . You need to print the absolute difference between P1 & P2**.↵
↵
$N \le 10^{5}$↵
$K \le 10^{6}$
↵
**As they travel from city u to v , the popularity of cities in between increases by x units.**↵
**Let $P1$ and $P2$ be the sum of popularities of the cities of Jack and Bob after $Q$ tours . You need to print the absolute difference between P1 & P2**.↵
↵
$N \le 10^{5}$↵
$K \le 10^{6}$
