import sys

def minimal_travel_cost(A, B, C, X, Y, D):
    # Maximum segment length is X + Y
    max_segment = X + Y
    # Precompute cost for each possible segment length
    cost = [0] * (max_segment + 1)
    for k in range(1, max_segment + 1):
        if k <= X:
            cost[k] = A
        elif k <= X + Y:
            cost[k] = A + B * (k - X)
        else:
            cost[k] = A + B * Y + C * (k - X - Y)
    
    # Initialize DP array
    INF = float('inf')
    dp = [INF] * (D + 1)
    dp[0] = 0  # Cost to travel 0 meters is 0
    
    # Fill DP array
    for i in range(1, D + 1):
        # Iterate over all possible segment lengths
        for k in range(1, max_segment + 1):
            if i - k >= 0:
                if dp[i - k] + cost[k] < dp[i]:
                    dp[i] = dp[i - k] + cost[k]
    
    return dp[D]

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    T = int(data[0])
    idx = 1
    results = []
    for _ in range(T):
        A = int(data[idx])
        B = int(data[idx+1])
        C = int(data[idx+2])
        X = int(data[idx+3])
        Y = int(data[idx+4])
        D = int(data[idx+5])
        idx +=6
        cost = minimal_travel_cost(A, B, C, X, Y, D)
        results.append(str(cost))
    print('\n'.join(results))

if __name__ == "__main__":
    main()