#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, c, k, a, t, u, v, w, cz, l, r, mubiao[5][101], dis[101][101], head[100001], pos;
struct edge
{
    int u, v, w, next;
} e[1000001];
void add(int u, int v, int w)
{
    e[++pos].u = u;
    e[pos].v = v;
    e[pos].w = w;
    e[pos].next = head[u];
    head[u] = pos;
}
int dijstra(int st, int ed)
{
    // cout<<st<<' '<<ed<<endl;
    for (int i = 1; i <= n; i++)
        dis[st][i] = 1e18;
    dis[st][st] = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.push(make_pair(0, st));
    while (!q.empty())
    {
        int u = q.top().second;
        q.pop();
        for (int i = head[u]; i; i = e[i].next)
        {
            int v = e[i].v;
            if (dis[st][v] > dis[st][u] + e[i].w)
            {
                dis[st][v] = dis[st][u] + e[i].w;
                q.push(make_pair(dis[st][v], v));
            }
        }
    }
    return dis[st][ed];
}
int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
signed main()
{
    n = read();
    m = read();
    c = read();
    k = read();
    a = read();
    t = read();
    for (int i = 1; i <= n; i++)
    {
        u = read();
        v = read();
        w = read();
        add(u, v, w);
        add(v, u, w);
    }
    for (int i = 1; i <= c; i++)
    {
        for (int j = 1; j <= k; j++)
        {
            mubiao[j][i] = read();
        }
    }
    while (t--)
    {
        cz = read();
        if (cz == 1)
        {
            u = read();
            for (int i = 1; i <= k; i++)
            {
                mubiao[i][u] = read();
            }
        }
        else
        {
            l = read();
            r = read();
            int duiyin[5];

            int minn = 1e18, ans, res = 0;
            for (int j = l; j < r; j++)
            {
                for (int i = 1; i <= k; i++)
                {
                    duiyin[i] = mubiao[i][j+1];
                }
                do
                {
                    // cout<<"gernshin";
                    ans = 0;
                    int minnn = 1e18;
                    for (int i = 1; i <= k; i++)
                    {
                        ans += dijstra(mubiao[i][j], duiyin[i]);
                        minnn = min(minnn, dijstra(mubiao[i][j], duiyin[i]));
                    }
                    ans += minnn * (a - 1);
                    minn = min(minn, ans);
                } while (next_permutation(duiyin + 1, duiyin + k + 1));
                res+=minn;
            }
            printf("%lld\n", res);
        }
    }
    return 0;
}