B"You have n chains, the i -th chain consists of c_i vertices. Vertices in each chain are numbered independently from 1 to c_i along the chain. In other words, the i -th chain is the undirected graph with c_i vertices and (c_i - 1) edges connecting the j -th and the (j + 1) -th vertices for each 1 <= j < c_i . Now you decided to unite chains in one graph in the following way: Calculate the length of the longest simple cycle in the resulting graph. A simple cycle is a chain where the first and last vertices are connected as well. If you travel along the simple cycle, each vertex of this cycle will be visited exactly once. The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The first line of each test case contains the single integer n ( 2 <= n <= 10^5 ) -- the number of chains you have. The second line of each test case contains n integers c_1, c_2, ... , c_n ( 2 <= c_i <= 10^9 ) -- the number of vertices in the corresponding chains. The third line of each test case contains n integers a_1, a_2, ... , a_n ( a_1 = -1 ; 1 <= a_i <= c_{i - 1} ). The fourth line of each test case contains n integers b_1, b_2, ... , b_n ( b_1 = -1 ; 1 <= b_i <= c_{i - 1} ). Both a_1 and b_1 are equal to -1 , they aren't used in graph building and given just for index consistency. It's guaranteed that the sum of n over all test cases doesn't exceed 10^5 . For each test case, print the length of the longest simple cycle. In the first test case, the longest simple cycle is shown below: We can't increase it with the first chain, since in such case it won't be simple -- the vertex 2 on the second chain will break simplicity. "...