// #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()

template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
using ll = int64_t;
using ull = uint64_t;
using PLL = pair<ll, ll>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return max(low, min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { t = clamp(t, low, high); }

namespace init__ {

struct InitIO {
    InitIO() {
        cin.tie(nullptr);
        ios_base::sync_with_stdio(false);
        cout << fixed << setprecision(30);
    }
} init_io;

}

#ifdef DEBUGGING
#include "../../debug/debug.cpp"
#else
#define DEBUG(...) 0
#define DEBUG_SEPARATOR_LINE 0
#endif

template <typename T>
T make_v(T init) { return init; }

template <typename T, typename... Tail>
auto make_v(T init, size_t s, Tail... tail) {
#define rec make_v(init, tail...)
    return V<decltype(rec)>(s, rec);
#undef rec
}

const ll inf = 1e18;

V<ll> dijk(ll start, const VV<PLL> &edges) {
    size_t node_cnt = edges.size();
    V<ll> dists(node_cnt, inf);
    dists[start] = 0;
    priority_queue<PLL, V<PLL>, greater<PLL>> pq;
    pq.emplace(0, start);
    while(pq.size()) {
        ll dist, now;
        tie(dist, now) = pq.top();
        pq.pop();
        if(dists[now] < dist) continue;
        for(auto &&edge : edges[now]) {
            ll nxt, cost;
            tie(nxt, cost) = edge;
            ll nxt_dist = dist + cost;
            if(dists[nxt] <= nxt_dist) continue;
            dists[nxt] = nxt_dist;
            pq.emplace(nxt_dist, nxt);
        }
    }
    return dists;
}

void input(V<ll> &v) { for(auto &&ele : v) cin >> ele; }

int main() {
    ll N, M, K;
    cin >> N >> M >> K;
    V<ll> pan(N), jam_k(N), jam_h(N);
    input(pan);
    input(jam_k);
    input(jam_h);
    for(auto &&ele : jam_k) ele--;
    VV<PLL> edges(N);
    for(ll i = 0; i < M; i++) {
        ll u, v, t;
        cin >> u >> v >> t;
        u--; v--;
        edges[u].emplace_back(v, t);
        edges[v].emplace_back(u, t);
    }

    auto dist_from_init = dijk(0, edges);
    ll start = 2 * N;
    VV<PLL> edges_to_jam(2 * N + 1);
    const ll base = 5e15;
    for(ll i = 0; i < N; i++) {
        edges_to_jam[start].emplace_back(i + N, base - (pan[i] - dist_from_init[i]));
        edges_to_jam[i + N].emplace_back(i, 0);
        edges_to_jam[i] = move(edges[i]);
    }

    auto dist_from_pan = dijk(start, edges_to_jam);
    V<ll> ans(K, -inf);
    for(ll i = 0; i < N; i++) {
        ll dist = dist_from_pan[i];
        dist = base - dist;
        ll happiness = dist + jam_h[i] - dist_from_init[i];
        chmax(ans[jam_k[i]], happiness);
    }
    for(auto &&ele : ans) cout << ele << endl;
    return 0;
}



Measured memory_bytes: 32936