Minimum Deletion Cost to Avoid Repeating Letters

Ninja has given a string 'S' of lowercase characters of size 'N'. He also has provided an array 'COST' where 'COST[i]' refers to the Cost of deleting the ‘i’th character in the string.

Ninja doesn't like a string with the same adjacent characters, so he asked you to help him transform the given string into the string with no adjacent repetitive characters by deleting some characters in it.

Cost of deleting some characters is the sum of costs of individual deletion of characters at every position. Your task is to find the minimum cost needed to transform the string with no adjacent repetitive characters.

Example:

Input: 'S' = "babbc", 'COST' = [1, 2, 3, 4, 5] 
Output: 3

By deleting the third letter 'b' with cost, 3 will transform the string into 'babc'. This is the minimum possible cost to transform the string.

Input Format :

The first line of input contains an integer 'T', denoting the number of test cases. 

For each test case, the first line contains an integer 'N' second line contains a string of size 'N' and the last line contains the 'N' elements in the array 'COST'.

Output format :

For each test case, print the minimum cost needed to transform the string.

Output for each test case will be printed in a separate line.

Note :

You don't need to print anything. It has already been taken care of. Just implement the given function.

Constraints :

1 <= ‘T’ <= 10
2 <= 'N' <= 10^4
1 <= 'COST[i]'<= 10^4
Time Limit: 1sec