hdu step1.1.

 

/*#include <iostream>
using namespace std;
int main()
{
  
 int n,data,i,j,m;

     cin >> n ；
 
   {
    i=n;
    while( i-- != 0 )
    {
    //cout<<endl;
   
          cin>>m;
              int s=0;
     j=m;
                while(j--!=0)
       {
                  cin>>data;
                  s+=data;
        
       }
                      cout<<s<<endl;
    }
  
 return 0;
}*/
//方法依旧超时！！！！！！！！
/*#include <stdio.h>
int main()
{
    int z, n, s, t;
      scanf("%d", &z);
        while (z-- != 0)
  {
   scanf("%d", &n);
               s = 0;
                 while (n-- != 0)
     {
                     scanf("%d", &t);
                       s += t;
     }
                       printf("%d\n", s);
                            if (z != 0)
       {
                                printf("\n");
       }
}
     return 0;
}*/
#include <iostream>
using namespace std;
int main()
{
  
 int n,data,m;
    cin>>n; 
    while( n-- != 0 )
    {   
          cin>>m;
              int s=0;
                while(m--!=0)
       {
                  cin>>data;
                  s+=data;
        
       }
                      cout<<s<<endl;
      if (n != 0)
       {
                               cout<<endl;
       } 
    }
  
 return 0;
}
//格式很复杂