#include <iostream>

using lint = long long;
constexpr lint INF = 1LL << 50;

void solve() {
    lint a, b, c, ca, cb, cc;
    std::cin >> a >> b >> c >> ca >> cb >> cc;

    lint ans = INF;
    {
        // b is max
        lint na = a, nb = b, nc = c;
        lint cost = 0;

        if (na >= nb) {
            cost += (na - nb + 1) * ca;
            na = nb - 1;
        }
        if (nc >= nb) {
            cost += (nc - nb + 1) * cc;
            nc = nb - 1;
        }

        if (na == nc) {
            cost += std::min(ca, cc);
            --na;
        }

        if (na > 0 && nb > 0 && nc > 0) {
            ans = std::min(ans, cost);
        }
    }

    {
        // b is min
        lint na = a, nb = b, nc = c;
        lint cost = 0;

        if (na == nc) {
            cost += std::min(ca, cc);
            --na;
        }

        if (na <= nb) {
            cost += (nb - na + 1) * cb;
            nb = na - 1;
        }

        if (nc <= nb) {
            cost += (nb - nc + 1) * cb;
            nb = nc - 1;
        }

        if (na > 0 && nb > 0 && nc > 0) {
            ans = std::min(ans, cost);
        }
    }

    std::cout << (ans == INF ? -1 : ans) << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int q;
    std::cin >> q;
    while (q--) solve();

    return 0;
}