#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;


void solve(){
    ll a,b,c;
    cin>>a>>b>>c;
    ll s,t,u;
    cin>>u>>s>>t;
    ll target[]={a+1,a,b-2,b-1,b,b+1,b+2,c+1,c};
    ll ans = longinf;
    rep(i,9)rep(j,9)rep(k,9){
        ll x = target[i],y=target[j],z=target[k];
        if(x<a||y<b||z<c)continue;
        if(x<=0 ||y<= 0||z<=0)continue;
        if(x==y||y==z||z==x)continue;
        ll sum = x-a+y-b+z-c;
        if(x<=sum || y<=sum || z<= sum)continue;
        if(y>x && y>z) ans = min(ans,-s*(a-x)-t*(b-y)-u*(c-z));
        if(y<x && y<z) ans = min(ans,-s*(a-x)-t*(b-y)-u*(c-z));
    }
    if(ans == longinf)cout<<-1<<endl;
    else cout<<ans<<endl;
}
int main(){
    int t;
    cin>>t;
    rep(i,t)solve();
    return 0;
}