#include<bits/stdc++.h>

using namespace std;

const int MAXN=+;

const int MAXM=;

const int INF=0x3f3f3f3f;

struct Edge{

    int to,next,cap,flow,cost;

}edge[MAXM];

int head[MAXN],tol;

int pre[MAXN],dis[MAXN];

bool vis[MAXN];

int n;

void init(){

    tol=;

    memset(head,-,sizeof(head));

}

void addedge(int u,int v,int cap,int cost){

    edge[tol].to=v;

    edge[tol].cap=cap;

    edge[tol].cost=cost;

    edge[tol].flow=;

    edge[tol].next=head[u];

    head[u]=tol++;

    edge[tol].to=u;

    edge[tol].cap=;

    edge[tol].cost=-cost;

    edge[tol].flow=;

    edge[tol].next=head[v];

    head[v]=tol++;

}

bool spfa(int s,int t){

    queue<int> q;

    memset(dis,INF,sizeof(dis));

    memset(vis,false,sizeof(vis));

    memset(pre,-,sizeof(pre));

    dis[s]=;

    vis[s]=true;

    q.push(s);

    while(!q.empty()){

        int u=q.front();

        q.pop();

        vis[u]=false;

        for(int i=head[u];i!=-;i=edge[i].next){

            int v=edge[i].to;

            if(edge[i].cap>edge[i].flow&&dis[v]>dis[u]+edge[i].cost){

                dis[v]=dis[u]+edge[i].cost;

                pre[v]=i;

                if(!vis[v]){

                    vis[v]=true;

                    q.push(v);

                }

            }

        }

    }

    if(pre[t]==-)

        return false;

    else

        return true;

}

int minCostMaxFlow(int s,int t,int &cost){

    int flow=;

    cost=;

    while(spfa(s,t)){

        int Min=INF;

        for(int i=pre[t];i!=-;i=pre[edge[i^].to]){

            if(Min>edge[i].cap-edge[i].flow)

                Min=edge[i].cap-edge[i].flow;

        }

        for(int i=pre[t];i!=-;i=pre[edge[i^].to]){

            edge[i].flow+=Min;

            edge[i^].flow-=Min;

            cost+=edge[i].cost*Min;

        }

        flow+=Min;

    }

    return flow;

}

/*

int main(){

    int M,S,T;

    scanf("%d%d%d%d",&N,&M,&S,&T);

    init(N);

    while(M--){

        int u,v,cap,cost;

        scanf("%d%d%d%d",&u,&v,&cap,&cost);

        addedge(u,v,cap,cost);

    }

    int cost=0;

    int flow=minCostMaxFlow(S,T,cost);

    printf("%d %d\n",flow,cost);

}*/

int getid(int id,int T){

    return T*+id;

}

int g[][]={};

int co[][]={};

struct Node{

    int a,b,s,t,c;

}node[];

int main() {

    init();

    int s=,s1=,T,m,k;

    scanf("%d%d%d%d",&n,&m,&k,&T);

    int t=getid(,T);

    addedge(s1,s,k,);//不超过k架飞机

    for(int i=;i<n;i++){

        for(int j=;j<n;j++){

            scanf("%d",&g[i][j]);

        }

    }

    for(int i=;i<n;i++){

        for(int j=;j<n;j++){

            scanf("%d",&co[i][j]);

        }

    }

    for(int i=;i<n;i++){

        int ti=g[i][];

        int u=getid(i,T-ti);

        addedge(u,t,k,co[i][]);

    }

    for(int i=;i<m;i++){

        scanf("%d%d%d%d%d",&node[i].a,&node[i].b,&node[i].s,&node[i].t,&node[i].c);

        int u=getid(node[i].a,node[i].s),v=getid(node[i].b,node[i].t);

        addedge(u,v,,-node[i].c);

    }

    for(int i=;i<m;i++){

        for(int j=;j<m;j++){

            if(node[j].t+g[node[j].b][node[i].a]<=node[i].s){

                int u=getid(node[j].b,node[j].t);int v=getid(node[i].a,node[i].s);

                addedge(u,v,,co[node[j].b][node[i].a]);

            }

        }

        if(g[][node[i].a]<=node[i].s){

            int u=;int v=getid(node[i].a,node[i].s);

            addedge(u,v,,co[][node[i].a]);

        }

        if(node[i].t+g[node[i].b][]<=T){

            int u=getid(node[i].b,node[i].t);int v=t;

            addedge(u,v,,co[node[i].b][]);

        }

    }

    /*for(int ti=0;ti<T;ti++){

        for(int u=0;u<n;u++){

            addedge(getid(u,ti),getid(u,ti+1),k,0);

        }

    }*/

    /*while(m--){

        int t1,a,t2,b,cost;

        scanf("%d%d%d%d%d",&a,&b,&t1,&t2,&cost);

        int u=getid(a,t1),v=getid(b,t2);

        addedge(u,v,1,-cost);

        for(int i=0;i<n;i++){

            if(i==a)

                continue;

            int ti=g[i][a];

            if(t1-ti>=0)

                addedge(getid(i,t1-ti),u,1,co[i][a]);

        }

       // cout<<"cost="<<cost<<endl;

    }*/

    int cost;

    int flow=minCostMaxFlow(s1,t,cost);

    printf("%d\n",-cost);

}