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: import sys
  import math
  from math import *
  import builtins
  import collections
  import bisect
  import os
  from io import BytesIO, IOBase
  
  
  def print(x, end='\n'):
      sys.stdout.write(str(x) + end)
  
  
  # IO helpers
  def get_int():
      return int(input())
  
  
  def get_list_ints():
      return list(map(int, input().split()))
  
  
  def get_char_list():
      s = input()
      return list(s[:len(s) - 1])
  
  
  def get_tuple_ints():
      return tuple(map(int, input().split()))
  
  
  def print_iterable(p):
      print(" ".join(map(str, p)))
  
  def CountFrequency(arr):
      return collections.Counter(arr) 
   
  def reverse(s):
      l=len(s)
      for i in range(l//2):
          s[i],s[l-i-1]=s[l-i-1],s[i]
      return s
  
  
  def binary_search(arr, x):
      low = 0
      high = len(arr) - 1
      mid = 0
      while low <= high:
          mid = (high + low) // 2
          if arr[mid] < x:
              low = mid + 1
          elif arr[mid] > x:
              high = mid - 1
          else:
              return mid
      return high
  
  #STD lower bound equivalent in python
  def lower_bound(arr,x):
      return bisect.bisect_left(arr, x, lo=0, hi=len(arr))
   
   #STD upper bound equivalent in python
  def upper_bound(arr,x):
      return bisect.bisect_right(arr, x, lo=0, hi=len(arr))
  
  def position(x):
      return ord(x)-ord("a")+1
  
  
  def pow(a,n):
      if n==0:
          return 1
      elif n%2==0:
          return ((pow(a,n//2)%const)*(pow(a,n//2)%const))%const
      else:
          return ((pow(a,n//2)%const)*(pow(a,n//2)%const)*(a%const))%const
  # Dynamic Programming Python implementation of Min Cost Path
  # problem
  R = 3
  C = 3
   
  
  
  def main():
      n=get_int()
      for i in range(n):
          m=get_int()
          row1=get_list_ints()
          row2=get_list_ints()
          slist=[0]
          for i in range(m-1):
              slist.append(slist[-1]+row2[i])
          slist2=[0]
          for i in range(m-1,0,-1):
              slist2.append(slist2[-1]+row1[i])
          slist2=reverse(slist2)
          anslist=[]
          for i in range(m):
              anslist.append(max(slist[i],slist2[i]))
          print(min(anslist))
      pass
  
  
  ##Fast Input Output
  
  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")
  
  
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  
  # endregion
  
  if __name__ == "__main__":
      main()