
public class Main {
  static int n;
  private static void solve() {
    n = ni() * 2;
    if (n > 15) {
      return;
    }
    int Q = ni();
    int[] a = na(n);
    int[] b = na(n);
    int[][] query = ntable(Q, 3);
    
    
    for (int[] q : query) {
      a[q[0] - 1] = q[1];
      b[q[0] - 1] = q[2];

      long max = 0;
      for (int i = 0; i < (1 << n); i ++) {
        if (!check(i)) continue;
        for (int j = i; j < (1 << n); j ++) {
          if (!check(j)) continue;
          
          long score = 0;
          for (int k = 0; k < n; k ++) {
            int b1 = (i >> k) & 1;
            int b2 = (j >> k) & 1;
            score += b1 == b2 ? a[k] : b[k];
          }
          max = Math.max(max, score);
        }
      }
      System.out.println(max);
    }
    
  }
  
  private static boolean check(int x) {
    int level = 0;
    for (int i = 0; i < n; i ++) {
      if (((x >> i) & 1) == 0) {
        level ++;
      } else {
        level --;
        if (level < 0) {
          return false;
        }
      }
    }
    return level == 0;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}


