#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N,M; cin >> N >> M;
  vector<ll> A(M);
  rep(i,M) cin >> A[i];
  ll s = 0;
  rep(i,M) s += A[i]*A[i];
  int Q; cin >> Q;
  while(Q--){
    int c; ll k; int d; cin >> c >> k >> d;
    c--; d--;
    s -= A[c]*A[c];
    s += (A[c]-k)*(A[c]-k);
    s -= A[d]*A[d];
    s += (A[d]+k)*(A[d]+k);
    A[c]-=k;
    A[d]+=k;
    cout << s << '\n';
  }
  return 0;
}