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: 					/*
  					TO LEARN
  					1-segment trees
  					2-euler tour
  				
  					*/
  					/*
  					TO SOLVE 
  					uva 1103
  					codeforces 722 kavi on pairing duty
  					*/
  					/*
  					bit manipulation shit
  					1-Computer Systems: A Programmer's Perspective
  					2-hacker's delight
  					3-(02-03-bits-ints)
  					4-machine-basics
  					5-Bits Manipulation tutorialspoint
  					*/
  					/*
  					TO WATCH
  					1-what is bitmasking by kartik arora youtube
  					*/
  					            import java.util.*;
  							    import java.math.*;
  							    import java.io.*; 
  							    import java.util.stream.Collectors;
  
  							       public class A{
  							     
  							  static InputStream inputStream = System.in;
  					            static FastScanner scan=new FastScanner();
  							     public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
  
  						static long brute(long n,int cnt1,int cnt2,int cnt3,long res)
  						{
  							if(n<=0){
  								if(res==230)
  									out.println(cnt1+" "+cnt2+" "+cnt3);
  								return 0;
  							}
  							return Math.min(brute(n-10,cnt1+1,cnt2,cnt3,res+25)+25,Math.min(brute(n-8,cnt1,cnt2+1,cnt3,res+15)+20,brute(n-6,cnt1,cnt2,cnt3+1,res+15)+15));
  						}
  						static long rand()
  {
  
         Random rand = new Random();
         int min=1;
         int max=100;
          int random_int = (int)Math.floor(Math.random()*(max-min+1)+min);
         
      //    int rand_int2 = rand.nextInt(1000000);
    
         return  random_int;
  }
  						public static void main(String[] args)  throws Exception 
  					      {
  					 
  
  								///scan=new FastScanner("cownomics.in");
  							//out = new PrintWriter("cownomics.out");
  							 
  							 /*
  							 currently doing 
  							 1-digit dp
  							 2-ds like fenwick and interval tree and sparse table 
  							 */
  							 /*
  							 READING 
  							 1-Everything About Dynamic Programming codeforces
  							 2-DYNAMIC PROGRAMMING: FROM NOVICE TO ADVANCED topcoder
  							 3-Introduction to DP with Bitmasking codefoces
  							 4-Bit Manipulation hackerearth
  							 5-read more about mobious and inculsion-exclusion 
  							 */
  		
  
  							    int tt=1;						
  				tt=scan.nextInt();
  						 outer:while(tt-->0)
  							    {
  							    	int n=scan.nextInt();
  							    	int a1[]=new int[n];
  							    	int a2[]=new int[n];
  							    	for(int i=0;i<n;i++)
  							    		a1[i]=scan.nextInt();
  							    	for(int i=0;i<n;i++)
  							    		a2[i]=scan.nextInt();
  							    	for(int i=1;i<n;i++)
  							    	{
  							    		a1[i]+=a1[i-1];
  							    		a2[i]+=a2[i-1];
  							    	}
  							    	int res=Integer.MAX_VALUE;
  							    	for(int i=0;i<n;i++)
  							    	{
  							    		if(i==0)
  							    		{
  							    			res=a1[n-1]-a1[i];
  							    			continue;
  							    		}
  							    		res=Math.min(res,Math.max(a1[n-1]-a1[i],a2[i-1]));
  							    	}
  							    	out.println(res);
  
  
  		
  		
  
  	}
  	out.close();
  				}
  	    
  							static class special{
  								boolean bool;
  								long n;
  								//int id;
  								special(boolean bool,long n)
  								{
  									this.bool=bool;
  									this.n=n;
  								}
  								@Override
  								    public int hashCode() {
  							                int hash = 7;
  				    hash = 31 * hash + (int) n;
  				   
  				    return hash;
  							            }
  							              @Override
  							            public boolean equals(Object o){
  							                if (o == this) return true;
  							                if (o.getClass() != getClass()) return false;
  							                special t = (special)o;
  							                return t.bool == bool && t.n == n;
  							            }
  							}
  
  							   
  							     static long binexp(long a,long n)
  							    {
  							        if(n==0)
  							            return 1;
  							        long res=binexp(a,n/2);
  							        if(n%2==1)
  							            return res*res*a;
  							        else 
  							            return res*res;
  							    }
  							     
  							    static long powMod(long base, long exp, long mod) {
  							           if (base == 0 || base == 1) return base;
  							           if (exp == 0) return 1;
  							           if (exp == 1) return (base % mod+mod)%mod;
  							           long R = (powMod(base, exp/2, mod) % mod+mod)%mod;
  							           R *= R;
  							           R %= mod;
  							           if ((exp & 1) == 1) {
  							               return (base * R % mod+mod)%mod;
  							           }
  							           else return (R %mod+mod)%mod;
  							       }
  							    static double dis(double x1,double y1,double x2,double y2)
  							    {
  							        return Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
  							    }
  							    static long mod(long x,long y)
  							        {
  							            if(x<0)
  							                x=x+(-x/y+1)*y;
  							            return x%y;
  							        }
  							     public static  long pow(long b, long e) {
  							                long r = 1;
  							                while (e > 0) {
  							                    if (e % 2 == 1) r = r * b ;
  							                    b = b * b;
  							                    e >>= 1;
  							                }
  							                return r;
  							            }
  							    private static void sort(long[] arr) {
  							            List<Long> list = new ArrayList<>();
  							            for (long object : arr) list.add(object);
  							            Collections.sort(list);
  							        //Collections.reverse(list);
  							            for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);
  							        }
  							    private static void sort2(long[] arr) {
  							            List<Long> list = new ArrayList<>();
  							            for (Long object : arr) list.add(object);
  							            Collections.sort(list);
  							        Collections.reverse(list);
  							            for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);
  							        }
  							     static class FastScanner
  					{
  					    private int BS = 1 << 16;
  					    private char NC = (char) 0;
  					    private byte[] buf = new byte[BS];
  					    private int bId = 0, size = 0;
  					    private char c = NC;
  					    private double cnt = 1;
  					    private BufferedInputStream in;
  					 
  					    public FastScanner() {
  					        in = new BufferedInputStream(System.in, BS);
  					    }
  					 
  					    public FastScanner(String s) {
  					        try {
  					            in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
  					        } catch (Exception e) {
  					            in = new BufferedInputStream(System.in, BS);
  					        }
  					    }
  					 
  					    private char getChar() {
  					        while (bId == size) {
  					            try {
  					                size = in.read(buf);
  					            } catch (Exception e) {
  					                return NC;
  					            }
  					            if (size == -1) return NC;
  					            bId = 0;
  					        }
  					        return (char) buf[bId++];
  					    }
  					 
  					    public int nextInt() {
  					        return (int) nextLong();
  					    }
  					 
  					    public int[] nextInts(int N) {
  					        int[] res = new int[N];
  					        for (int i = 0; i < N; i++) {
  					            res[i] = (int) nextLong();
  					        }
  					        return res;
  					    }
  					 
  					    public long[] nextLongs(int N) {
  					        long[] res = new long[N];
  					        for (int i = 0; i < N; i++) {
  					            res[i] = nextLong();
  					        }
  					        return res;
  					    }
  					 
  					    public long nextLong() {
  					        cnt = 1;
  					        boolean neg = false;
  					        if (c == NC) c = getChar();
  					        for (; (c < '0' || c > '9'); c = getChar()) {
  					            if (c == '-') neg = true;
  					        }
  					        long res = 0;
  					        for (; c >= '0' && c <= '9'; c = getChar()) {
  					            res = (res << 3) + (res << 1) + c - '0';
  					            cnt *= 10;
  					        }
  					        return neg ? -res : res;
  					    }
  					 
  					    public double nextDouble() {
  					        double cur = nextLong();
  					        return c != '.' ? cur : cur + nextLong() / cnt;
  					    }
  					 
  					    public double[] nextDoubles(int N) {
  					        double[] res = new double[N];
  					        for (int i = 0; i < N; i++) {
  					            res[i] = nextDouble();
  					        }
  					        return res;
  					    }
  					 
  					    public String next() {
  					        StringBuilder res = new StringBuilder();
  					        while (c <= 32) c = getChar();
  					        while (c > 32) {
  					            res.append(c);
  					            c = getChar();
  					        }
  					        return res.toString();
  					    }
  					 
  					    public String nextLine() {
  					        StringBuilder res = new StringBuilder();
  					        while (c <= 32) c = getChar();
  					        while (c != '\n') {
  					            res.append(c);
  					            c = getChar();
  					        }
  					        return res.toString();
  					    }
  					 
  					    public boolean hasNext() {
  					        if (c > 32) return true;
  					        while (true) {
  					            c = getChar();
  					            if (c == NC) return false;
  					            else if (c > 32) return true;
  					        }
  					    }
  					}
  
  							     static class Pair implements Comparable<Pair>{
  							            public long x, y,z;
  							            public Pair(long x1, long y1,long z1) {
  							                x=x1;
  							                y=y1;
  							                z=z1;
  							            }
  							             public Pair(long x1, long y1) {
  							                x=x1;
  							                y=y1;
  							    
  							            }
  							            
  							            @Override
  							            public int hashCode() {
  							                return (int)(x + 31 * y);
  							            }
  							            public String toString() {
  							                return x + " " + y+" "+z;
  							            }
  							            @Override
  							            public boolean equals(Object o){
  							                if (o == this) return true;
  							                if (o.getClass() != getClass()) return false;
  							                Pair t = (Pair)o;
  							                return t.x == x && t.y == y&&t.z==z;
  							            }
  							    public int compareTo(Pair o)
  							    {
  							    	
  							    if(o.x==x)
  							    	return (int)((o.y)-y);
  							    	return (int)(o.x-x);
  							     
  							        }
  							     
  							    }
  							    
  							    }
  
  							     
  