#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll INF = 1e18;

ll calc(vector<ll>& a, vector<ll>& b, vector<ll>& c) {
    ll res = 0;
    for (int i = 0; i < 3; ++i) {
        if (c[i] < 1) return INF;
        if (a[i] < c[i]) return INF;
        res += b[i] * (a[i] - c[i]);
    }

    vector<ll> d = c;
    sort(d.begin(), d.end());
    if (d[0] == d[1] || d[1] == d[2]) return INF;
    if (c[1] == d[0] || c[1] == d[2]) return res;
    else return INF;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    for (int lo = 0; lo < t; ++lo) {
        vector<ll> a(3);
        vector<ll> b(3);
        for (int i = 0; i < 3; ++i) {
            cin >> a[i];
        }
        for (int i = 0; i < 3; ++i) {
            cin >> b[i];
        }

        vector<ll> v;
        for (int i = 0; i < 3; ++i) {
            v.push_back(a[i]);
            v.push_back(a[i] - 1);
            v.push_back(a[i] - 2);
        }

        ll ans = INF;
        for (ll i : v) {
            for (ll j : v) {
                for (ll k : v) {
                    vector<ll> c = {i, j, k};
                    ans = min(ans, calc(a, b, c));
                }
            }
        }
        cout << (ans >= INF ? -1 : ans) << "\n";
    }

    return 0;
}