#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
signed main()
{
	int T;
	cin >> T;
	int ans = 0, a, n = 0;
	while(T--)
	{
		ans = 0;
		cin >> n;
		for(int i = 1; i <= n; i++)
		{
			cin >> a;
			ans += a;
		}
		cout << ans << endl;
	}
	return 0;
}

#include <iostream>
using namespace std;
int m, n, a, s;
int main()
{
	cin >> m;
	while(m --)
	{
		cin >> n;
		s = 0;
		while(n --)
		{
			cin >> a;
			s += a;
		}
		cout << s << endl << endl;
	}
	return 0;
}

#include<bits/stdc++.h> using namespace std; int main() { int n,m,a,s=0; cin>>n; for(int i=1; i<=n; i++) { cin>>m; for(int j=1; j<=m; j++) { cin>>a; s+=a; } cout<<s<<endl; s=0; } return 0; }

#include

using namespace std;

int main() {

int n,a,b,sum=0;

cin>>n;

for(int i=1;i<=n;i++){

cin>>a;

for(int j=1;j<=a;j++){

cin>>b;

sum+=b;	

}

cout<<sum<<endl<<" "<<endl;

sum=0;

}

}

#include using namespace std; int main() { int N; cin >> N; for (int i = 0; i < N; ++i) { int M; cin >> M; int sum = 0; for (int j = 0; j < M; ++j) { int num; cin >> num; sum += num; } cout << sum << endl; if (i != N - 1) { cout << endl; } } return 0; }

#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
signed main()
{
	int T;
	cin >> T;
	int ans = 0, a, n = 0;
	while(T--)
	{
		ans = 0;
		cin >> n;
		for(int i = 1; i <= n; i++)
		{
			cin >> a;
			ans += a;
		}
		cout << ans << endl;
	}
	return 0;
}