Cakes [A]

Memory limit: 256 MB

Masters of baking from all over the country have come to this year's Bytean confectioners' convention. During the convention there will be a competition for the best cake baked by a team of three confectioners. Each three confectioners may submit at most one cake. However, each contestant can be a member of multiple teams. Unfortunately, some confectioners do not like each other and would not like to bake cakes together.

For each contestant it is known how many decagrams of flour she requires to bake a cake. A three-person team needs as much flour as its member with highest requirements. How much flour will be used during the competition, provided that each three confectioners that all like each other will bake exactly one cake?

Input

The first line of the standard input contains two integers and (, ) separated by a single space and denoting the number of confectioners at the convention and the number of pairs of them that like each other. The participants of the convention are numbered from to . The second line contains integers () separated by single spaces and denoting the requirements of respective confectioners for flour (in decagrams). The following lines contain data about pairs of contestants that like each other. Each of these lines contains two integers and () separated by a single space. They denote that confectioners and like each other. We assume that all pairs of participants of the convention apart from the ones listed in the input would not like to bake cakes together. Each pair of confectioners appears at most once in the input.

Output

The first and only line of the standard output should contain a single integer - the quantity of flour that will be used by all teams in total, in decagrams.

Example

For the input data:

5 7
1 5 3 4 2
1 2
2 3
5 2
4 3
3 1
1 4
5 1

the correct result is:

14

Explanation of the example. The following three-person teams: , and require 5, 5 and 4 decagrams of flour to bake the cakes. In total decagrams of flour are required.

Task author: Jakub Lacki.