#include <bits/stdc++.h>
using namespace std;
long long x, n, q, a[200020], b[200020], ans, p, y, t1, t2;
long long f(int k, int w, int e) {
  if (w < 0 or e < 0) return -(long long)(1e9 + 7);
  if (k == 2 * n) return ((w == 0 and e == 0) ? 0 : -(long long)(1e9 + 7));
  long long ret = -(long long)(1e9 + 7);
  ret = f(k + 1, w + 1, e + 1) + a[k];
  ret = max(ret, f(k + 1, w + 1, e - 1) + b[k]);
  ret = max(ret, f(k + 1, w - 1, e + 1) + b[k]);
  ret = max(ret, f(k + 1, w - 1, e - 1) + a[k]);
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> q;
  for (int i = 0; i < 2 * n; i++) cin >> a[i];
  for (int i = 0; i < 2 * n; i++) cin >> b[i];
  while (q--) {
    cin >> p >> x >> y;
    p--;
    a[p] = x, b[p] = y;
    cout << f(0, 0, 0) << endl;
  }
}
