#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
#define ll long long
#define ull unsigned ll
#define ld long double
#define bl __int128_t
#define fi first
#define se second
#define vel vector<ll>
#define vvel vector<vel>
#define pll pair<ll,ll>
#define vepll vector<pll>
#define vvepll vector<vepll>
#define ves vector<string>
#define vem vector<mint>
#define vvem vector<vem>
#define pmm pair<mint,mint>
#define vepmm vector<pmm>
#define cleout(i) cout<<fixed<<setprecision(i)
template<class T>using PQ=priority_queue<T,vector<T>,greater<T>>;
//               上  右 下 左
vector<int> di={-1, 0, 1, 0};
vector<int> dj={ 0, 1, 0,-1};

vector<int> dx={ 0, 1, 0,-1};
vector<int> dy={ 1, 0,-1, 0};


vector<int> ddx={ 1, 1, 1, 0, -1, -1, -1, 0 };
vector<int> ddy={ 1, 0, -1, -1, -1, 0, 1, 1 };

ll inf=1000000000000000000;//1e18
// LLONG_MAX

mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count());

//[x^M]1/(1-x)^N=comb(N-1+M,M)

bool check(pll s,pll t){
    if(s.fi==t.fi||s.se==t.se||(s.fi+s.se)==(t.fi+t.se)||(s.fi-s.se)==(t.fi-t.se))return 1;
    return 0;
}

void _solve(){
    ll H,W,x,y,N;
    cin>>H>>W>>x>>y>>N;
    vepll a(N+1);
    a[0]={x,y};
    vel c(N+1);
    rep(i,1,N+1)cin>>a[i].fi>>a[i].se>>c[i];
    vel dp(N+1,-inf);
    dp[0]=0;
    dp[1]=0;
    rep(i,1,N+1){
        if(check(a[i-1],a[i])){
            dp[i]=max(dp[i],dp[i-1]+c[i]);
        }
        if(i>1)dp[i]=max(dp[i],dp[i-2]+c[i]);
    }
    ll ans=-inf;
    rep(i,0,N+1)ans=max(ans,dp[i]);
    cout<<ans<<"\n";
}



int main(){
    cin.tie(nullptr);
 	ios_base::sync_with_stdio(false);
    
    ll _;
    bool multitest=0;
    if(multitest)cin>>_;
    else _=1;
    rep(__,0,_){
        _solve();
    }
}