#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define mp make_pair
#define sec second
#define fir first
#define pii pair<int,int>
#define lowbit(i) i&-i
#define double long double
#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N=4e5+5,M=30,S=(1<<8)+5,inf=(ll)1e18+7;
const double eps=1e-8;
void read(int &p){
	int x=0,w=1;
	char ch=0;
	while(!isdigit(ch)){
		if(ch=='-')w=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		x=(x<<1)+(x<<3)+ch-'0';
		ch=getchar();
	}
	p=x*w;
}
int n,m,ans,vala[N],valq[N],qpos[N];
pii a[N],q[N];
int lsh[2][N],cntl[2],numn=0;
struct seg{
    int t[4][4*N],pren[4*N],tag[4*N];
    void pushup(int x){
        rep(i,0,3)
            t[i][x]=t[i][ls(x)]+t[i][rs(x)];
        pren[x]=pren[ls(x)];
    }
    int nwv[4];
    void addtag(int x,int v){
        if(!v)return;
        tag[x]+=v,pren[x]+=v;
        rep(i,0,3)
            nwv[i]=t[i][x];
        rep(i,0,3)
            t[((i+v)%4+4)%4][x]=nwv[i];
    }
    void pushdown(int x){
        addtag(ls(x),tag[x]),addtag(rs(x),tag[x]);
        tag[x]=0;
    }
    void modify(int x,int le,int ri,int p,int v,int op){
        if(le==ri){
            if(!op)numn+=v;
            t[(pren[x]+1)%4][x]+=v*lsh[op][le];
            return;
        }
        pushdown(x);
        int mid=(le+ri)>>1;
        if(p<=mid)addtag(rs(x),v),modify(ls(x),le,mid,p,v,op);
        else modify(rs(x),mid+1,ri,p,v,op);
        pushup(x);
    }
}T[2];
unordered_map<int,int>stp;
int calc(){
    int res=T[0].t[0][1]+T[0].t[1][1];
    if(numn&1)res+=T[1].t[0][1]+T[1].t[2][1];
    else res+=T[1].t[1][1]+T[1].t[3][1];
    return ans+res;
}
signed main(){
    read(n),read(m);
    rep(i,1,n){
        read(a[i].fir),read(a[i].sec),ans+=a[i].sec;
        int del=a[i].fir-a[i].sec;
        if(del<0)lsh[0][++cntl[0]]=del;
        else lsh[1][++cntl[1]]=del;
    }
    rep(i,1,m){
        read(qpos[i]),read(q[i].fir),read(q[i].sec);
        int del=q[i].fir-q[i].sec;
        if(del<0)lsh[0][++cntl[0]]=del;
        else lsh[1][++cntl[1]]=del;
    }
    rep(i,0,1){
        sort(lsh[i]+1,lsh[i]+cntl[i]+1);
        stp.clear();
        rep(j,1,cntl[i])
            if(!stp[lsh[i][j]])stp[lsh[i][j]]=j;
        rep(j,1,n)
            if(stp[a[j].fir-a[j].sec])vala[j]=stp[a[j].fir-a[j].sec]++;
        rep(j,1,m)
            if(stp[a[j].fir-a[j].sec])valq[j]=stp[a[j].fir-a[j].sec]++;
    }
    rep(i,1,n){
        if(a[i].fir-a[i].sec<0)T[0].modify(1,1,cntl[0],vala[i],1,0);
        else T[1].modify(1,1,cntl[1],vala[i],1,1);
    }
    printf("%lld\n",calc());
    rep(j,1,m){
        int i=qpos[j];
        if(a[i].fir-a[i].sec<0)T[0].modify(1,1,cntl[0],vala[i],-1,0);
        else T[1].modify(1,1,cntl[1],vala[i],-1,1);
        ans-=a[i].sec;
        vala[i]=valq[j],a[i]=q[j];
        ans+=a[i].sec;
        if(a[i].fir-a[i].sec<0)T[0].modify(1,1,cntl[0],vala[i],1,0);
        else T[1].modify(1,1,cntl[1],vala[i],1,1);
        printf("%lld\n",calc());
    }
    return 0;
}