#include <bits/stdc++.h>
using namespace std;

#define ll long long

bool getBit(ll num, int idx)
{
    return ((num >> idx) & 1);
}

const int mod=1e9+7;

void solve()
{
    int N;
    cin>>N;
    vector<int>A(N);
    for (int I=0;I<N;I++)
    {
        cin>>A[I];
    }
    sort(A.begin(),A.end());
    vector<map<int,int>>B;
    vector<vector<int>>temp;
    temp.push_back({0});
    for (int I=1;I<(1<<N);I++)
    {
        vector<int>V;
        for (int J=0;J<N;J++)
        {
            if (getBit(I,J))
            {
                V.push_back(A[J]);
            }
        }
        temp.push_back(V);
    }
    sort(temp.begin(),temp.end());
    for (auto it:temp)
    {
        map<int,int>tempe;
        for (auto itt:it)
        {
            tempe[itt]++;
        }
        B.push_back(tempe);
    }
    map<int,vector<ll>>primes;
    for (int I=0;I<N;I++)
    {
        vector<ll>V((1<<N)+2,0);
        primes[A[I]]=V;
    }
    int Q;
    cin>>Q;
    for (int I=0;I<Q;I++)
    {
        int l,r,x;
        cin>>l>>r>>x;
        primes[x][l]++;;
        primes[x][r+1]--;
    }
    int sz=B.size();
    for (int I=0;I<N;I++)
    {
        for (int J=1;J<sz;J++)
        {
            primes[A[I]][J]+=primes[A[I]][J-1];
        }
        for (int J=1;J<sz;J++)
        {
            if (B[J][A[I]]%2==0)
            {
                if (primes[A[I]][J]%2!=0)
                {
                    B[J][A[I]]=1;
                }
            }
            else if (B[J][A[I]]%2!=0)
            {
                if (primes[A[I]][J]%2!=0)
                {
                    B[J][A[I]]=0;
                }
            }
        }
    }

    for (auto it:B)
    {
        ll res=1;

        for (auto itt:it)
        {
            if (itt.second>0)
            {
                res*=itt.first;
                res%=mod;
            }
        }
        if (res == 0)continue;
        cout<<res<<" ";
    }
    cout<<endl;
}

int main()
{
    cin.tie(0);

    int t = 1;

    //cin >> t;

    while (t--)
    {
        solve();
    }

    return 0;
}