#include <bits/stdc++.h>
using namespace std;
int N, Q, p, x, y, a[200009], b[200009];
int main() {
  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];
  for (int i = 0; i < Q; i++) {
    cin >> p >> x >> y;
    p--;
    a[p] = x;
    b[p] = y;
    int bc = 0, bm = 1012345678;
    long long ret = a[0] + a[2 * N - 1];
    for (int j = 1; j < 2 * N - 1; j++) {
      ret += max(a[j], b[j]);
      if (a[j] < b[j]) {
        bc++;
        bm = min(bm, b[j] - a[j]);
      }
    }
    cout << ret - (bc & 1 ? bm : 0) << endl;
  }
  return 0;
}
