#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

constexpr lint INF = 4e18;

lint dfs(lint A, lint B, lint C, lint X, lint Y, lint Z, int depth) {
    lint ret = INF;
    if (A <= 0 or B <= 0 or C <= 0) return INF;
    if (A != B and B != C and C != A) return 0;
    if (depth == 0) return INF;
    mmin(ret, X + dfs(A - 1, B - 1, C, X, Y, Z, depth - 1));
    mmin(ret, Y + dfs(A, B - 1, C - 1, X, Y, Z, depth - 1));
    mmin(ret, Z + dfs(A - 1, B, C - 1, X, Y, Z, depth - 1));
    return ret;
}
lint solve1(lint A, lint B, lint C, lint X, lint Y, lint Z)
{
    // a < b > c にする
    lint sub = max({A - B + 1, C - B + 1, 0LL});
    lint cost = sub * Z;
    A -= sub;
    C -= sub;
    return dfs(A, B, C, X, Y, Z, 3) + cost;
}

lint solve2(lint A, lint B, lint C, lint X, lint Y, lint Z)
{
    // a > b < c にする
    lint cost = 0;
    lint suby = max(B - A + 1, 0LL);
    B -= suby, C -= suby;
    cost += suby * Y;
    lint subx = max(B - C + 1, 0LL);
    A -= subx, C -= subx;
    cost += subx * X;
    return dfs(A, B, C, X, Y, Z, 3) + cost;
}

int main()
{
    int T;
    cin >> T;
    while (T--) {
        lint A, B, C, X, Y, Z;
        cin >> A >> B >> C >> X >> Y >> Z;
        lint ret = min(solve1(A, B, C, X, Y, Z), solve2(A, B, C, X, Y, Z));
        cout << (ret <= INF / 2 ? ret : -1) << endl;
    }
}