Infection (Challenge)

In Chef’s World, there are a total of $N$ countries (numbered $1$ through $N$). Each $i^{th}$ $(1 \leq i \leq N)$ country has a population of $P_i$ people. Countries are interconnected by $M$ bidirectional Flight routes (numbered $1$ through $M$). Each Flight route has a Flight cost associated with it. For simplicity, let’s denote $j^{th}$ Flight route that connects countries $U$ and $V$ and has f