#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int T;
main()
{
	cin>>T;
	for(;T--;)
	{
		long A[3],C[3];
		for(int i=0;i<3;i++)cin>>A[i];
		cin>>C[2]>>C[0]>>C[1];
		long ans=9e18;
		vector<int>id={0,1,2};
		do{
			if(id[1]==1)continue;
			long a=A[id[0]],b=A[id[1]],c=A[id[2]];
			long now=0;
			long X=0,Y=0;
			if(a>=b)
			{
				now+=C[id[1]]*(a-b+1);
				X=a-b+1;
				b=a+1;
			}
			if(b>=c)
			{
				now+=C[id[2]]*(b-c+1);
				Y=b-c+1;
				c=b+1;
			}
			a=A[id[0]],b=A[id[1]],c=A[id[2]];
			a-=X+Y;
			b-=Y;
			c-=X;
			if(a<=0||b<=0||c<=0)continue;
			ans=min(ans,now);
		}while(next_permutation(id.begin(),id.end()));
		if(ans>=6e18)ans=-1;
		cout<<ans<<endl;
	}
}