#include<bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + ;

const int inf = 2e9;

int n , m;

struct info

{

        int l , r , k , home;

        bool type;

} a[MAXN << ];

set< pair<int,pair<int,int> > > s;

int ans[MAXN];

template <typename T> inline void chkmax(T &x,T y) { x = max(x,y); }

template <typename T> inline void chkmin(T &x,T y) { x = min(x,y); }

template <typename T> inline void read(T &x)

{

    T f = ; x = ;

    char c = getchar();

    for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;

    for (; isdigit(c); c = getchar()) x = (x << ) + (x << ) + c - '';

    x *= f;

}

inline bool cmp(info a,info b)

{

        if (a.r != b.r) return a.r > b.r;

        else return a.type > b.type;

}

int main()

{

        read(n);

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

        {

                int l , r;

                scanf("%d%d",&l,&r);

                a[i] = (info){l,r,,i,false};

        }

        read(m);

        for (int i = ; i <= m; i++)

        {

                int l , r , k;

                scanf("%d%d%d",&l,&r,&k);

                a[n + i] = (info){l,r,k,i,true};

        }

        sort(a + ,a + (n + m) + ,cmp);

        for (int i = ; i <= n + m; i++)

        {

                if (a[i].type)

                {

                        s.insert(make_pair(a[i].l,make_pair(a[i].k,a[i].home)));

                        continue;

                } else

                {

                        s.insert(make_pair(a[i].l,make_pair(inf,inf)));

                        set< pair<int,pair<int,int> > > :: iterator it = s.find(make_pair(a[i].l,make_pair(inf,inf)));

                        if (it == s.begin())

                        {

                                printf("NO\n");

                                return ;

                        }

                        it--;

                        pair< int,pair<int,int> > tmp = (*it);

                        s.erase(it);

                        ans[a[i].home] = tmp.second.second;

                        if (tmp.second.first > ) s.insert(make_pair(tmp.first,make_pair(tmp.second.first - ,tmp.second.second)));

                        it = s.find(make_pair(a[i].l,make_pair(inf,inf)));

                        s.erase(it);

                }

        }

        printf("YES\n");

        for (int i = ; i <= n; i++) printf("%d ",ans[i]);

        printf("\n");

        return ;

}