#include <bits/stdc++.h>

#pragma GCC optimize("O3")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
#pragma GCC target("avx2")
// #pragma GCC optimize("unroll-loops")

using namespace std;

using i64 = int64_t;

const i64 MOD = (i64)1e9 + 7;

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


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;
}

#ifdef TEST
#define dump(x) fprintf(stderr, "line =%4d, name =%7s , ", __LINE__, #x); cout << "value = " << x << endl;
#define vecdump(x) fprintf(stderr, "line =%4d, name =%7s\n", __LINE__, #x); _dump_macro(x);
#else
#define vecdump(x)
#define dump(x)
#endif


void _dump(int, string& x){
#ifdef TEST
    cout << x << endl;
#endif
}

template <typename T>
void _dump(bool, T& x){
#ifdef TEST
    cout << x << " ";
#endif
}

template <typename T, typename U = typename T::iterator>
void _dump(int, T& x){
#ifdef TEST
    for(auto& elm : x)
        _dump(0, elm);

    cout << endl;
#endif
}

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)...);
}


i64 solve(){

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

    vector<i64> p(n), c(n), j(n);
    for(int i = 0; i < n; ++i)
        scanf("%ld", &p[i]);
    for(int i = 0; i < n; ++i){
        scanf("%ld", &c[i]);
        --c[i];
    }
    for(int i = 0; i < n; ++i)
        scanf("%ld", &j[i]);
    vector<vector<pair<i64,i64>>> edges(n);
    for(int i = 0; i < m; ++i){
        int u, v, t;
        scanf("%d %d %d", &u, &v, &t);
        --u, --v;
        edges[u].emplace_back(v, t);
        edges[v].emplace_back(u, t);
    }

    priority_queue<pair<i64,i64>,vector<pair<i64,i64>>,greater<pair<i64,i64>>> que;
    que.emplace(0, 0);
    vector<i64> r(n, INF);
    r[0] = 0;
    while(!que.empty()){
        int pos = que.top().second;
        que.pop();
        for(auto& ed_p : edges[pos])
            if(chmin(r[ed_p.first], r[pos] + ed_p.second))
                que.emplace(r[ed_p.first], ed_p.first);
    }
    vector<i64> r_(n + 1, INF);
    r_[n] = 0;
    edges.emplace_back();
    for(int i = 0; i < n; ++i){
        edges[n].emplace_back(i, r[i] - p[i]);
    }
    que.emplace(0, n);
    while(!que.empty()){
        int pos = que.top().second;
        que.pop();
        for(auto& ed_p : edges[pos])
            if(chmin(r_[ed_p.first], r_[pos] + ed_p.second))
                que.emplace(r_[ed_p.first], ed_p.first);
    }
    vector<i64> ans(k, -INF);
    for(int i = 0; i < n; ++i){
        chmax(ans[c[i]], j[i] - (r[i] + r_[i]));
    }
    for(auto& x : ans)
        printf("%ld\n", x);

    return 0;

}


signed main(){

    int t = 0;
    solve();
}



Measured memory_bytes: 24624