#include <bits/stdc++.h>

using namespace std;

using i64 = int64_t;

const i64 MOD = 1e9+7;

const i64 INF = i64(1e18)+MOD;

template <typename T = i64>
struct Range{
    struct iterator{
        T value;
        const T step, last;
        const T& operator*(){return value;}
        iterator(T value, T step, T last) :
            value(step < static_cast<T>(0) ? max(last, value) : min(last, value)),
            step(step),
            last(last)
        {
        }
        iterator operator++(){value = step < static_cast<T>(0) ? max(value + step, last) : min(value + step, last); return *this;}
        bool operator!=(const iterator& x){return value != x.value;}
    };
    const T start, last, step;

    Range(const T start, const T last, const T step = static_cast<T>(1)) :
        start(start),
        last(last),
        step(step)
    {
    }

    Range(const T last) :
        start(0),
        last(last),
        step(1)
    {
    }

    iterator begin(){return iterator(start, step, last);}
    iterator end(){return iterator(last, step, last);}
};

template <typename F>
struct FixPoint{
    const F _f;
    FixPoint(F&& f) : _f(forward<F>(f)){}

    template<typename... Types>
    decltype(auto) operator()(Types&&... args) const{
        return _f(*this, forward<Types>(args)...);
    }
};

template <typename F>
static decltype(auto) makeRec(F&& f){
    return FixPoint<F>(forward<F>(f));
}

template <typename T, T Value = T()>
vector<T> makeVector(size_t x){
    return vector<T>(x, T(Value));
}

template <typename T, T Value = T(), typename... Types>
auto makeVector(size_t x, Types... args){
    return vector<decltype(makeVector<T, Value>(args...))>(x, makeVector<T, Value>(args...));
}

template <typename T = i64>
bool chmax(T& a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template <typename T = i64>
bool chmin(T& a, T b){
    if(a > b){
        a = b;
        return true;
    }
    return false;
}

#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); clog << "value = " << x << endl;

#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);

void _dump(int, string& x){
    clog << x << endl;
}

template <typename T>
void _dump(bool, T& x){
    clog << x << " ";
}

template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){

    for(auto& elm : x)
        _dump(0, elm);

    clog << endl;
}

template <typename T>
void _dump_macro(T& x){
    _dump(0, x);
}

void _input(int, string& x){
    cin >> x;
}

template <typename T>
void _input(bool, T& x){
    cin >> x;
}

template <typename T, typename U = typename T::iterator>
void _input(int, T& x){

    for(auto& elm : x)
        _input(0, elm);
}

template <typename T>
void input_single(T& x){
    _input(0, x);
}

auto input(){}

template <typename T, typename... Types>
void input(T& value, Types&&... args){
    input_single(value);
    input(forward<Types>(args)...);
};

void _pararell_input(size_t){}

template <typename T, typename... Types>
void _pararell_input(size_t index, T& value, Types&&... args){
    input(value[index]);
    _pararell_input(index, forward<Types>(args)...);
}

template <typename... Types>
void pararell_input(size_t count, Types&&... args){
    for(const auto& i : Range<>(count))
        _pararell_input(i, forward<Types>(args)...);
}


bool solve(){

    int n, m, c, s, g;
    input(n, m, c, s, g);
    if(!n)
        return false;
    --s, --g;

    auto wfa = [&](vector<vector<i64>>& range){
        for(int k = 0; k < n; ++k)
            for(int i = 0; i < n; ++i)
                for(int j = 0; j < n; ++j)
                    chmin(range[i][j], range[i][k] + range[k][j]);
    };

    vector<vector<vector<i64>>> com_dist(c, vector<vector<i64>>(n, vector<i64>(n, INF)));
    for(int i = 0; i < m; ++i){
        int x, y, dist, com;
        input(x, y, dist, com);
        --x, --y, --com;
        chmin(com_dist[com][x][y], 1L * dist);
        chmin(com_dist[com][y][x], 1L * dist);
    }
    for(auto& x : com_dist)
        wfa(x);
    vector<int> p(c);
    input(p);
    vector<vector<i64>> q(c), r(c), cost(c);
    for(int i = 0; i < c; ++i){
        q[i].resize(p[i]);
        r[i].resize(p[i]);
        cost[i].resize(p[i]);
        q[i][0] = 0;
        cost[i][0] = 0;
        for(int j = 0; j < p[i] - 1; ++j)
            input(q[i][j + 1]);
        input(r[i]);
        for(int j = 0; j < p[i] - 1; ++j)
            cost[i][j + 1] = cost[i][j] + (q[i][j + 1] - q[i][j]) * r[i][j];
    }

    auto f = [&](int co, i64 dist){
        if(dist == INF)
            return dist;
        auto it = upper_bound(q[co].begin(), q[co].end(), dist);
        int idx = distance(q[co].begin(), it) - 1;
        i64 diff = dist - q[co][idx];
        i64 ret = cost[co][idx] + r[co][idx] * diff;
        return ret;
    };

    for(int i = 0; i < c; ++i)
        for(int j = 0; j < n; ++j)
            for(int k = 0; k < n; ++k)
                com_dist[i][j][k] = f(i, com_dist[i][j][k]);

    for(int i = 0; i < c; ++i)
        for(int j = 0; j < n; ++j)
            for(int k = 0; k < n; ++k)
                chmin(com_dist[0][j][k], com_dist[i][j][k]);

    wfa(com_dist[0]);
    cout << (com_dist[0][s][g] == INF ? - 1 : com_dist[0][s][g]) << endl;

    return true;
}

signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    while(solve());

}



Measured memory_bytes: 4720