Friendship Fee

Lee Junseok, admitted in the class of 2019, has entered a school with $N$ students. Wanting to mark his admission, Junseok wants to become friends with every student. But Junseok has spent his whole life talking only to computers, so he does not know how to speak with people. Even for Junseok there is hope. It is the friendship fee!

If you give student $i$ an amount $A_i$ of money, that student will be your friend for one month. Junseok has a total of $k$ won, and he decided to use that money to make friends. As he actually went about making friends, he began to think that he would run out of money. So Junseok decided to use the rule "a friend of a friend is a friend".

Now Junseok does not have to pay every friend!

Using this logic, find the way to become friends with everyone at the lowest cost.

The first line gives the number of students $N$ ($1 \le N \le 10,000$), the number of friend relations $M$ ($0 \le M \le 10,000$), and the money Junseok has, $k$ ($1 \le k \le 10,000,000$).

The second line gives the friendship fee $A_i$ that each of the $N$ students wants. ($1 \le A_i \le 10,000$, $1 \le i \le N$)

The next $M$ lines give numbers $v, w$. This means student $v$ and student $w$ are friends with each other. A student may be friends with themselves, and the same friend relation may be given multiple times.

If Junseok can make every student his friend, print the minimum cost of making them friends. If he cannot make friends with all of them, print “Oh no” (without the quotation marks).