#!/usr/bin/python3
# @EXPECTED_RESULTS@: ACCEPTED, TIME_LIMIT_EXCEEDED
(a, b, c), ws, ps = map(int, input().split()), input(), input()
n = len(ps)

for w in ws:
    cost = [[None] * (len(ps) + 1) for _ in range(2)]
    cost[0][0], cost[1][0] = 0, c
    for i, p in enumerate(ps, start=1):
        cost[0][i] = 2 ** 42 if p == w else min(cost[0][i - 1], cost[1][i - 1] + c)
        cost[1][i] = min(cost[0][i - 1] + c, cost[1][i - 1]) + (b if p == w else a)
    print(min(cost[0][n], cost[1][n] + c))