#include <bits/stdc++.h>
int a[200000], d[200000];
int* dp[200000];
int const INF = 1000000007;
bool comp(const int* a, const int* b) { return *a < *b; }
int main(void) {
  int n, q, i, j, tmp;
  long long sum = 0, ans;
  scanf("%d %d", &n, &q);
  for (i = 0; i < 2 * n; i++) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  for (i = 0; i < 2 * n; i++) {
    scanf("%d", &tmp);
    d[i] = tmp - a[i];
    dp[i] = &d[i];
  }
  int p, x, y;
  for (i = 0; i < q; i++) {
    scanf("%d%d%d", &p, &x, &y);
    sum = sum + x - a[p - 1];
    a[p - 1] = x;
    d[p - 1] = y - x;
    d[0] = -INF;
    d[2 * n - 1] = -INF;
    std::sort(dp, dp + 2 * n, comp);
    ans = sum;
    for (j = 2 * n - 1; j > 0 && *(dp[j - 1]) > 0; j -= 2) {
      ans = ans + (*(dp[j])) + (*(dp[j - 1]));
    }
    printf("%lld\n", ans);
  }
}
