#include<bits/stdc++.h>
using namespace std;
#define int long long
int dis[105][105];
int b[4][4],w[400005][4];
int n,m,c,k,a,t;
struct nd{
	int a[4][4];
};
struct node{
	int l,r;
	nd aa;
	void add(){
		memset(aa.a,31,sizeof(aa.a));
	//	cout << 11 << endl;
		for(int i =0;i<k;i++){
			for(int j =0;j<k;j++){
				int p[5],h = 0;
				for(int ll =0;ll<k;ll++)if(ll!=i)p[++h] = ll;
				do{
					int tot = dis[w[l][i]][w[l+1][j]]*a;
					//cout << tot << endl;
					for(int ii =1;ii<=k-1;ii++)tot+=dis[w[l][p[ii]]][w[l+1][ii-1+(j<=ii-1)]];
					aa.a[i][j] = min(aa.a[i][j],tot);
				}while(next_permutation(p+1,p+1+h));
			}
		}//cout << 111 << endl;
	}
}tree[1500000];
void push_up(int kk){
	memset(tree[kk].aa.a,63,sizeof(tree[kk].aa.a));
	//cout << 11 << endl;
	for(int i =0;i<k;i++){
		for(int j =0;j<k;j++){
			for(int l =0;l<k;l++){
				tree[kk].aa.a[i][j] = min(tree[kk].aa.a[i][j],tree[kk<<1].aa.a[i][l]+tree[kk<<1|1].aa.a[l][j]);
			}
		}
	}//cout << 111 << endl;
	return;
}
void build(int l,int r,int k){
	//cout << " "<< l << " " << r << " " << k << endl;
	tree[k].l =l ,tree[k].r = r;
	if(l+1 == r){
		tree[k].add();return;
	}build(l,l+r>>1,k<<1),build(l+r>>1,r,k<<1|1);
	push_up(k);return;
}void upd(int k,int pos){
	int l = tree[k].l,r =tree[k].r;
	if(pos>=r or pos<l)return;
	if(l+1 == r and l==pos){
		tree[k].add();return;
	}upd(k<<1,pos),upd(k<<1|1,pos);push_up(k);
}nd query(int kk,int l,int r){
	//cout << " " << k << " " << l << " " << r << endl;
	int ll = tree[kk].l,rr = tree[kk].r;
	//cout << ll << " " << rr << endl;
	int mid = ll+rr>>1;
	if(l<=ll and rr<=r)return tree[kk].aa;
	if(r<=mid)return query(kk<<1,l,r);
	if(l>=mid)return query(kk<<1|1,l,r);
	nd aa = query(kk<<1,l,r),bb = query(kk<<1|1,l,r);
	nd cc;memset(cc.a,63,sizeof(cc.a));
	for(int i =0;i<k;i++){
		for(int j =0;j<k;j++){
			for(int l =0;l<k;l++){
				cc.a[i][j] = min(cc.a[i][j],aa.a[i][l]+bb.a[l][j]);
			}
		}
	}return cc;
}
signed main(){
	ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
	memset(dis,31,sizeof(dis));
	for(int i =0;i<=n;i++)dis[i][0] = dis[0][i] = 0;
	cin >> n >> m >> c >> k >> a >> t;
	for(int i = 1;i<=n;i++)dis[i][i] = 0;
	for(int i = 1;i<=m;i++){
		int a,b,c;cin >> a >> b >> c;
		dis[a][b] = dis[b][a] = min(dis[a][b],c);
	}for(int i = 1;i<=c;i++){
		for(int j =0;j<k;j++)cin>> w[i][j];
	}for(int l = 1;l<=n;l++){
		for(int i =1;i<=n;i++){
			for(int j = 1;j<=n;j++){
				dis[i][j] = min(dis[i][j],dis[i][l]+dis[l][j]);
			}
		}
	}
	build(1,c,1);//cout << 111 << endl;
	//cout << 11 << endl;
	for(int i = 1;i<=t;i++){
		int op;cin >> op;
		if(op == 1){
			int pos;cin >> pos;
			for(int j =0;j<k;j++)cin >> w[pos][j];
			upd(1,pos-1),upd(1,pos);
		}else{
			int l,r;cin >> l >> r;nd res= query(1,l,r);
			int mx =2000000000000005;
			for(int ii =0;ii<k;ii++)for(int jj =0;jj<k;jj++)mx = min(mx,res.a[ii][jj]);
			cout << mx << endl;
		}
	}
	return 0;
}