#include<bits/stdc++.h>
using namespace std;

void solve(){
  using ll=long long;
  ll a,b,c,x,y,z;
  cin>>a>>b>>c>>x>>y>>z;
  vector<pair<ll,ll>> vp={{a,x},{b,y},{c,z}};
  sort(vp.begin(),vp.end());
  ll ans=1e18;
  auto f=[&](ll pos){
    ll cost=0;
    for (int i=0;i<3;i++) cost+=abs(vp[i].first-pos)*vp[i].second;
    ans=min(ans,cost);
  };
  for (int i=0;i<3;i++) f(vp[i].first);
  cout<<ans<<endl;
}

int main(){
  int t;
  cin>>t;
  while (t--) solve();
}