#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using V = pair<char, int>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

#include <queue>
#include <map>

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll x, y, z;
    cin, x, y, z;
    map<char, ll> lst;
    lst['A'] = x;
    lst['B'] = y;
    lst['C'] = z;

    char S, G;
    int s, g;
    cin, S, s, G, g;

    V st = {S, s}, ed = {G, g};
    using Edge = pair<ll, V>;

    priority_queue<Edge, vector<Edge>, greater<Edge>> pq;
    pq.emplace(0, st);
    map<V, ll> cost;
    cost[st] = 0;

    auto update = [&](const V &v, ll c) {
        if (!cost.count(v) || cost[v] > c) {
            cost[v] = c;
            dump(v.first, v.second, c);
            return true;
        }
        return false;
    };

    while (pq.size()) {
        auto [c, v] = pq.top();
        pq.pop();
        auto [a, b] = v;
        if (cost.count(v) && cost[v] < c) continue;
        dump(a, b, c);
        if (v == ed) {
            print(c);
            return 0;
        }
        if (a == G) {
            if (update(ed, c + abs(b - g))) {
                pq.emplace(c + abs(b - g), ed);
            }
        }
        for (char ch = 'A'; ch <= 'C'; ch++) {
            if (update(V(ch, 1), c + b - 1 + (ch != a))) {
                pq.emplace(c + b - 1 + (ch != a), V(ch, 1));
            }
            if (update(V(ch, lst[ch]), c + lst[a] - b + (ch != a))) {
                pq.emplace(c + lst[a] - b + (ch != a), V(ch, lst[ch]));
            }
        }
    }

    return 0;
}