#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 3e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
int p[N] , n , m , k , L[N] , R[N] , res[N];
ll t[N];
int l[N] , r[N] , c[N];
vector<int> g[N] , v;
deque<pair<int,int>> q;
void upd(int i, int x) {
for(; i <= m; i |= (i + 1)) t[i] += x , v.push_back(i);
}
void updlr(int l, int r, int x){
upd(l, x); upd(r + 1, -x);
}
ll get(int i){
ll res = 0;
for(; i > 0; i = (i & (i + 1)) - 1) res += t[i];
ll con = 1000000000;
return min(res,con);
}
void cl(){
while(v.size()){
t[v.back()] = 0;
v.pop_back();
}
}
void solve(){
cin >> n >> m;
for(int i = 1; i <= m; i++) {
int a;
cin >> a;
g[a].push_back(i);
}
for(int i = 1; i <= n; i++) cin >> p[i];
cin >> k;
for(int i = 1; i <= n; i++) {
L[i] = 1;
R[i] = k;
q.push_back(make_pair((k+1)/2,i));
}
for(int i = 1; i <= k; i++) cin >> l[i] >> r[i] >> c[i];
for(int _ = 1; _ < 20; _++){
cl();
sort(all(q));
for(int i = 1; i <= k; i++){
if(l[i] > r[i]){
updlr(l[i],m,c[i]);
updlr(1,r[i],c[i]);
} else updlr(l[i],r[i],c[i]);
while(!q.empty() && q.front().F == i){
int x = q.front().S;
q.pop_front();
ll sum = p[x];
for(int y : g[x]) sum -= get(y);
if(sum <= 0){
res[x] = i;
R[x] = i-1;
} else {
L[x] = i+1;
}
if(L[x] <= R[x]) q.push_back({(L[x]+R[x])/2,x});
}
}
}
for(int i = 1; i <= n; i++) {
if(res[i] == 0){
cout << "NIE\n";
} else {
cout << res[i] << "\n";
}
}
}
/*
*/
signed main(){
ios;
solve();
return 0;
}
