Attack

Everyone knows that vampires exist. Yet nobody stops to think about how close these creatures live. The twilight kingdom has $n$ cities, and some pairs of cities are connected by two-way roads. Each city has its own vampire clan, which contains $k_i$ vampires.

Long ago, the vampires drove all werewolves out of the kingdom, which made the werewolves their bitter enemies. The werewolves did not like this. They decided to unite into one squad and attack a city. The attacking squad contains $w$ werewolves.

However, since vampires always act together, the werewolves doubt that the attack will succeed. They have come to you for help. Vampires can move between two cities connected by a road in one day. Also, during one day of battle, $\min(t, a, b)$ vampires defending the besieged city die, and the same number of werewolves die, where $a$ is the current size of the vampire group, $b$ is the current size of the werewolf group, and $t$ is a constant. Using this information, determine whether the vampires can defend the city. A city is besieged if there is a moment when more than zero werewolves are attacking it and zero vampires are defending it.

The first line contains three integers: $n$ ($1 \le n \le 10^5$), the number of cities, $m$ ($1 \le m \le 10^5$), the number of roads, and $t$ ($1 \le t \le 10^3$), the number of vampires and werewolves that die in one day of battle. The second line contains exactly $n$ integers $k_i$ ($1 \le k_i \le 10^4$), the number of vampires in the $i$-th city. The next $m$ lines describe the roads, each with two city numbers connected by a road. The last line contains the number of the attacked city and $w$ ($1 \le w \le 10^4$), the size of the werewolf army.

Print <> if the vampires can defend their city, and <> otherwise.

Note that if all vampires in the city die, and a new group arrives from a neighboring city the next day, the vampires still lose.