description: Alice and Bob are playing a game on a matrix, consisting of 2 rows and m columns. The cell in the i-th row in the j-th column contains a_{i, j} coins in it.
  
  Initially, both Alice and Bob are standing in a cell (1, 1). They are going to perform a sequence of moves to reach a cell (2, m).
  
  The possible moves are: 
  
    * Move right — from some cell (x, y) to (x, y + 1); 
    * Move down — from some cell (x, y) to (x + 1, y). 
  
  
  
  First, Alice makes all her moves until she reaches (2, m). She collects the coins in all cells she visit (including the starting cell).
  
  When Alice finishes, Bob starts his journey. He also performs the moves to reach (2, m) and collects the coins in all cells that he visited, but Alice didn't.
  
  The score of the game is the total number of coins Bob collects.
  
  Alice wants to minimize the score. Bob wants to maximize the score. What will the score of the game be if both players play optimally?
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
  
  Then the descriptions of t testcases follow.
  
  The first line of the testcase contains a single integer m (1 ≤ m ≤ 10^5) — the number of columns of the matrix.
  
  The i-th of the next 2 lines contain m integers a_{i,1}, a_{i,2}, ..., a_{i,m} (1 ≤ a_{i,j} ≤ 10^4) — the number of coins in the cell in the i-th row in the j-th column of the matrix.
  
  The sum of m over all testcases doesn't exceed 10^5.
  
  Output
  
  For each testcase print a single integer — the score of the game if both players play optimally.
  
  Example
  
  Input
  
  
  3
  3
  1 3 7
  3 5 1
  3
  1 3 9
  3 5 1
  1
  4
  7
  
  
  Output
  
  
  7
  8
  0
  
  Note
  
  The paths for the testcases are shown on the following pictures. Alice's path is depicted in red and Bob's path is depicted in blue.
  
  <image>
solution: #----------FASTIOSTART-----------#
  from __future__ import division, print_function
  import os
  import sys
  from io import BytesIO, IOBase
  if sys.version_info[0] < 3:
  	from __builtin__ import xrange as range
  	from future_builtins import ascii, filter, hex, map, oct, zip
  BUFSIZE = 8192
  class FastIO(IOBase):
  	newlines = 0
  	def __init__(self, file):
  		self._fd = file.fileno()
  		self.buffer = BytesIO()
  		self.writable = "x" in file.mode or "r" not in file.mode
  		self.write = self.buffer.write if self.writable else None
  	def read(self):
  		while True:
  			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
  			if not b:
  				break
  			ptr = self.buffer.tell()
  			self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
  		self.newlines = 0
  		return self.buffer.read()
  	def readline(self):
  		while self.newlines == 0:
  			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
  			self.newlines = b.count(b"\n") + (not b)
  			ptr = self.buffer.tell()
  			self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
  		self.newlines -= 1
  		return self.buffer.readline()
  	def flush(self):
  		if self.writable:
  			os.write(self._fd, self.buffer.getvalue())
  			self.buffer.truncate(0), self.buffer.seek(0)
  class IOWrapper(IOBase):
  	def __init__(self, file):
  		self.buffer = FastIO(file)
  		self.flush = self.buffer.flush
  		self.writable = self.buffer.writable
  		self.write = lambda s: self.buffer.write(s.encode("ascii"))
  		self.read = lambda: self.buffer.read().decode("ascii")
  		self.readline = lambda: self.buffer.readline().decode("ascii")
  def print(*args, **kwargs):
  	sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
  	at_start = True
  	for x in args:
  		if not at_start:
  			file.write(sep)
  		file.write(str(x))
  		at_start = False
  	file.write(kwargs.pop("end", "\n"))
  	if kwargs.pop("flush", False):
  		file.flush()
  if sys.version_info[0] < 3:
  	sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
  else:
  	sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  #----------FASTIOFINISH----------#
  import collections,string,bisect,re,random,queue,itertools,statistics,math
  from collections import *
  from bisect import *
  from string import *
  from itertools import * 
  from statistics import *
  from math import *
  from re import *
  from queue import *
  #----------SASTA_STL-------------#
  # stack
  class Stack:
      def __init__(self):self.items = []
      def push(self, item):self.items.append(item)
      def pop(self):return self.items.pop()
      def empty(self):return self.items == []
      def size(self):return len(self.items)
      def at(self,idx):
      	try:return self.items[idx]
      	except:return -1
  #priority_queue
  class priority_queue(object):
      def __init__(self):self.queue = []
      def __str__(self):return ' '.join([str(i) for i in self.queue])
      def empty(self):return len(self.queue) == 0
      def push(self, data):self.queue.append(data)
      def pop(self):
          try:
              max = 0
              for i in range(len(self.queue)):
                  if self.queue[i] > self.queue[max]:
                      max = i
              item = self.queue[max]
              del self.queue[max]
              return item
          except IndexError:
              print()
              exit()
  #----------SASTA_STL-------------#
  mod  = int(1e9+7)
  imax = float("inf")
  imin = float("-inf")
  true = True
  false= False
  N 	 = int(1e5)
  none = None
  inp  = lambda : input()
  I    = lambda : int(inp())
  M    = lambda : map(int,inp().split())
  MS   = lambda : map(str,inp().split())
  S    = lambda : list(MS())
  L    = lambda : list(M())
  def IO():
  	try:
  		sys.stdin = open('input.txt', 'r');
  		sys.stdout = open('uttar.txt', 'w')
  	except:
  		pass
  IO()
  class helper:
  	def first(self,arr):
  		return arr[0]
  	def second(self,arr):
  		return arr[1]
  	def is_sorted(self,arr):
  		return arr==sorted(arr)
  
  #----------TOTKA---------#
  
  def kabraji_ka_totka():
  	# totka hai dosto !
  	m=I()
  	mat = [L() for i in range(2)]
  	if m==1:
  		print(0)
  		return
  	max_range = sum(mat[0]) - mat[0][0]
  	res=max_range
  	y_axis = 0
  	for i in range(1,m):
  		y_axis += mat[1][i-1]
  		max_range-=mat[0][i]
  		res=min(res, max(max_range,y_axis))
  	print(max(res,0))
  
  #----------TOTKA----------#
  if __name__ == '__main__':
  	case=1;
  	case=I()
  	for i in range(case):
  		kabraji_ka_totka()
  