#pragma GCC optimize("O3", "unroll-loops") // "Ofast"
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
#include <bits/stdc++.h>
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvi = vt< vt<int> >;
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 60);
const double eps = 1e-6;
int n, q, a[N], l[N], r[N], x[N];
bool bit (int x, int i) {
return (x >> i & 1);
}
int add (int a, int b) {
a = (a + b);
if (a < 0) a += mod, a %= mod;
if (a >= mod) a %= mod;
return a;
}
int del (int a, int b) {
a = (a - b);
if (a < 0) a += mod, a %= mod;
if (a >= mod) a %= mod;
return a;
}
int mul (int a, int b) {
a = (a % mod) * (b % mod);
if (a < 0) a += mod, a %= mod;
if (a >= mod) a %= mod;
return a;
}
void upd (vt<int> v) {
int xr = 0;
for (int i = 1; i <= n; i++) xr ^= v[i], a[i] ^= xr;
}
void solve () {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
cin >> q;
for (int i = 0; i < q; i++) cin >> l[i] >> r[i] >> x[i];
int ans = 0;
for (int mask = 0; mask < (1 << q); mask++) {
vt<int> xr(n + 2, 0);
for (int i = 0; i < q; i++) {
if (bit(mask, i)) xr[l[i]] ^= x[i], xr[r[i] + 1] ^= x[i];
}
upd(xr);
for (int i = 1; i <= n; i++) {
int sum = 0;
for (int j = i; j <= n; j++) sum += a[j], ans = add(ans, mul(sum, sum));
}
upd(xr);
}
cout << ans;
cout << '\n';
}
bool testcases = 0;
signed main() {
#ifdef ONLINE_JUDGE
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
