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: /*
                         _oo0oo_
                        o8888888o
                        88" . "88
                        (| -_- |)
                        0\  =  /0
                      ___/`---'\___
                    .' \\|     |// '.
                   / \\|||  :  |||// \
                  / _||||| -:- |||||- \
                 |   | \\\  -  /// |   |
                 | \_|  ''\---/''  |_/ |
                 \  .-\__  '-'  ___/-. /
               ___'. .'  /--.--\  `. .'___
            ."" '<  `.___\_<|>_/___.' >' "".
           | | :  `- \`.;`\ _ /`;.`/ - ` : | |
           \  \ `_.   \_ __\ /__ _/   .-` /  /
       =====`-.____`.___ \_____/___.-`___.-'=====
                         `=---='
   
  */
  import java.util.function.Consumer;
  import java.util.*;
  import java.math.BigDecimal;
  import java.math.BigInteger;
  import java.math.RoundingMode;
  import java.text.DecimalFormat;
  import java.io.*;
  import java.lang.Math.*;
   public class KickStart2020{
  	static class FastReader {
          BufferedReader br;
          StringTokenizer st;
          public FastReader(){br = new BufferedReader(
             new InputStreamReader(System.in));}
          String next(){
              while (st == null || !st.hasMoreElements()) {
                  try { st = new StringTokenizer(br.readLine()); }
                  catch (IOException e) {e.printStackTrace();}}
              return st.nextToken();}
          int nextInt() { return Integer.parseInt(next()); }
          long nextLong() { return Long.parseLong(next()); }
          double nextDouble() { return Double.parseDouble(next());}
          float nextFloat() {return Float.parseFloat(next());}
          String nextLine() {
              String str = "";
              try {str = br.readLine();}
              catch (IOException e) { e.printStackTrace();}
              return str; }}
  	static boolean isBracketSequence(String s, int a, int b) {
  		Stack<Character> ss = new Stack<>();
  		boolean hachu = true;
  		for(int i = a; i <= b; i++) {
  			if(s.charAt(i) == ')' && ss.isEmpty()) {hachu = false; break;}
  			if(s.charAt(i) == '(') ss.add('(');
  			else ss.pop();
  		}
  		return ss.empty() && hachu;
  	}
  	static String reverseOfString(String a) {
  		StringBuilder ssd = new StringBuilder();
  		for(int i = a.length() - 1; i >= 0; i--) {
  			ssd.append(a.charAt(i));
  		}
  		return ssd.toString();
  	}
  	static char[] reverseOfChar(char a[]) {
  		char b[] = new char[a.length];
  		int j = 0;
  		for(int i = a.length - 1; i >= 0; i--) {
  			b[i] = a[j];
  			j++;
  		}
  		return b;
  	}
  	static boolean isPalindrome(char a[]) {
  		boolean hachu = true;
  		for(int i = 0; i <= a.length / 2; i++) {
  			if(a[i] != a[a.length - 1 - i]) {
  				hachu = false;
  				break;
  			}
  		}
  		return hachu;
  	} 
  	static long gcd(long a, long b)
  	{
  	    if (b == 0)
  	        return a;
  	    return gcd(b, a % b);
  	     
  	}
  	static long powermod(long x, long y, long mod){
  	    long ans = 1;
  	    x = x % mod; 
  	    if (x == 0)
  	      return 0; 
  	    int i = 1;
  	    while (y > 0){
  	      if ((y & 1) != 0)
  	        ans = (ans * x) % mod;
  	      y = y >> 1; 
  	      x = (x * x) % mod;
  	    }
  	    return ans;
  	  }
  	static long power(long x, long y){
  	    long ans = 1;
  	    if (x == 0)
  	      return 0; 
  	    int i = 1;
  	    while (y > 0){
  	      if ((y & 1) != 0)
  	        ans = (ans * x);
  	      y = y >> 1; 
  	      x = (x * x);
  	    }
  	    return ans;
  	  }
  	static boolean check(String a) {
  		boolean hachu = true;
  		for(int i = 0; i < a.length(); i++) {
  			if(a.charAt(0) != a.charAt(i)) {hachu = false; break;}
  		}
  		return hachu;
  	}
  	 public static class Pair implements Comparable<Pair> {
  	        public  int index;
  	        public  int value;
  	 
  	        public Pair(int index, int value) {
  	            this.index = index;
  	            this.value = value;
  	        }
  	        @Override
  	        public int compareTo(Pair other) {
  	            //multiplied to -1 as the author need descending sort order
  	            return   -1 * Integer.valueOf(this.value).compareTo(other.value);
  	        }
  	 }
  	 static boolean equalString(int i, int j, int arr[], String b) {
  		 int brr[] = new int[26];
  		 for(int k = i; k <= j; k++) brr[b.charAt(k) - 'a']++;
  		 for(int k = 0; k < 26; k++) {
  			 if(arr[k] != brr[k]) return false;
  		 }
  		 return true;
  	 }
  	 static boolean cequalArray(String a, String b) {
  		  int count[] = new int[26];
  		  int count1[] = new int[26];
  		  for(int i = 0; i < a.length(); i++) count[a.charAt(i) - 'a']++;
  		  for(int i = 0; i < a.length(); i++) count1[b.charAt(i) - 'a']++;
  		  for(int i = 0; i < 26; i++) if(count[i] != count1[i]) return false;
  		  return true;
  	 }
  	 static boolean isPrime(long d) {
  		 if(d == 1) return true;
  		 for(int i = 2; i <= (long)Math.sqrt(d); i++) {
  			 if(d % i == 0) return false;
  		 }
  		 return true;
  	 }
  		public static void main(String[] args) throws Exception{
  			FastReader sc = new FastReader();
  			PrintWriter out = new PrintWriter(System.out);
            int t = sc.nextInt();
            outerloop:
            while(t-- > 0) {
             int n = sc.nextInt();
             int arr[] = new int[n];
             int brr[] = new int[n];
             int crr[] = new int[n];
             int drr[] = new int[n];
             crr[0] = 0;
             drr[n - 1] = 0;
             for(int i = 0; i < n; i++) arr[i] = sc.nextInt();
             for(int i = 0; i < n; i++) brr[i] = sc.nextInt();
             for(int i = n - 2; i >= 0; i--) {
          	   drr[i] = drr[i + 1] + arr[i + 1];
             }
             for(int i = 1; i < n; i++) {
          	   crr[i] = crr[i - 1] + brr[i - 1];
             }
             int ans = Integer.MAX_VALUE;
             for(int i = 0; i < n; i++) {
          	   ans = Math.min(ans, Math.max(crr[i], drr[i]));
             }
             out.println(ans);
                
                
            }
                   out.close();
  			}
  		}