**Compilation/Execution Result:**

Given two strings X and Y, and two values costX and costY. We need to find minimum cost required to make the given two strings identical. We can delete characters from both the strings. The cost of deleting a character from string X is costX and from Y is costY. Cost of removing all characters from a string is same.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains integers X and Y denoting the value of costX and costY.

The second line of the test case contains the two strings X and Y.

**Output:**

Print the total cost to make the two strings equal for each test case in a new line.

**Constraints:**

1<= T <=100

1<= length of strings X and Y <=1000

1<= costX, costY <=1000

**Example:**

**Input:**

1

10 20

abcd acdb

**Output:**

30

Author: sujnesh

rksingh | 74 |

iharshitmittal | 74 |

sj5331 | 69 |

Himanshusinghchauhan | 63 |

Cqwert | 63 |

Shashank_Pathak | 636 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 359 |

rksingh | 358 |

akhayrutdinov | 4159 |

sanjay05 | 3611 |

Quandray | 2819 |

Ibrahim Nash | 2497 |

Michael Riegger | 2294 |