Rating changes for last rounds are temporarily rolled back. They will be returned soon.
×

Codeforces Round 250 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

graphs

greedy

sortings

*1400

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. The Child and Toy

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOn Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.

The toy consists of *n* parts and *m* ropes. Each rope links two parts, but every pair of parts is linked by at most one rope. To split the toy, the child must remove all its parts. The child can remove a single part at a time, and each remove consume an energy. Let's define an energy value of part *i* as *v*_{i}. The child spend *v*_{f1} + *v*_{f2} + ... + *v*_{fk} energy for removing part *i* where *f*_{1}, *f*_{2}, ..., *f*_{k} are the parts that are directly connected to the *i*-th and haven't been removed.

Help the child to find out, what is the minimum total energy he should spend to remove all *n* parts.

Input

The first line contains two integers *n* and *m* (1 ≤ *n* ≤ 1000; 0 ≤ *m* ≤ 2000). The second line contains *n* integers: *v*_{1}, *v*_{2}, ..., *v*_{n} (0 ≤ *v*_{i} ≤ 10^{5}). Then followed *m* lines, each line contains two integers *x*_{i} and *y*_{i}, representing a rope from part *x*_{i} to part *y*_{i} (1 ≤ *x*_{i}, *y*_{i} ≤ *n*; *x*_{i} ≠ *y*_{i}).

Consider all the parts are numbered from 1 to *n*.

Output

Output the minimum total energy the child should spend to remove all *n* parts of the toy.

Examples

Input

4 3

10 20 30 40

1 4

1 2

2 3

Output

40

Input

4 4

100 100 100 100

1 2

2 3

2 4

3 4

Output

400

Input

7 10

40 10 20 10 20 80 40

1 5

4 7

4 5

5 2

5 7

6 4

1 6

1 3

4 3

1 4

Output

160

Note

One of the optimal sequence of actions in the first sample is:

- First, remove part 3, cost of the action is 20.
- Then, remove part 2, cost of the action is 10.
- Next, remove part 4, cost of the action is 10.
- At last, remove part 1, cost of the action is 0.

So the total energy the child paid is 20 + 10 + 10 + 0 = 40, which is the minimum.

In the second sample, the child will spend 400 no matter in what order he will remove the parts.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/23/2024 12:27:04 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|