/* -*- coding: utf-8 -*-
 *
 * 967.cc:  No.967 引き算をして門松列(その2) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

ll check(int p, int q, int r, int x, int y, int z) {
  ll s = 0;
  int d0 = q - r + 1;
  if (d0 > 0) q -= d0, s += (ll)d0 * y;
  int d1 = p - q + 1;
  if (d1 > 0) p -= d1, s += (ll)d1 * x;

  return (p < 1) ? LINF : s;
}

inline void setmin(ll &a, ll b) { if (a > b) a = b; }

/* main */

int main() {
  int t;
  scanf("%d", &t);

  while (t--) {
    int a, b, c, x, y, z;
    scanf("%d%d%d%d%d%d", &a, &b, &c, &x, &y, &z);

    ll mind = LINF;
    setmin(mind, check(a, c, b, x, z, y));
    setmin(mind, check(c, a, b, z, x, y));
    setmin(mind, check(b, a, c, y, x, z));
    setmin(mind, check(b, c, a, y, z, x));

    printf("%lld\n", (mind >= LINF) ? -1 : mind);
  }
  return 0;
}