#include <bits/stdc++.h>

using namespace std;

const int N = 105;

vector< tuple<int, int, int> > G[N];
double px[N], py[N], ox[N], oy[N];

void rotate(double &x, double &y) {
    double nx = x * cos(1) - y * sin(1);
    double ny = x * sin(1) + y * cos(1);
    x = nx, y = ny;
}

int f[N][1 << 10], g[1 << 10], res[N];

signed main() {
    int p, n, m; scanf("%d%d%d", &p, &n, &m);
    for (int i = 0; i < p; ++i) scanf("%lf%lf", &px[i], &py[i]), rotate(px[i], py[i]);
    for (int i = 1; i <= n; ++i) scanf("%lf%lf", &ox[i], &oy[i]), rotate(ox[i], oy[i]);
    while (m--) {
        int x, y, w, o = 0; scanf("%d%d%d", &x, &y, &w);
        if (ox[x] > ox[y]) swap(x, y);
        for (int i = 0; i < p; ++i) {
            if (px[i] < ox[x] || px[i] > ox[y]) continue;
            if (py[i] < oy[x] * (px[i] - ox[x]) / (ox[y] - ox[x]) + oy[y] * (ox[y] - px[i]) / (ox[y] - ox[x])) o |= 1 << i;
        }
        G[x].push_back({y, w, o}), G[y].push_back({x, w, o});
    }
    memset(g, 0x3f, sizeof(g));
    for (int i = 1; i <= n; ++i) {
        memset(f, 0x3f, sizeof(f));
        f[i][0] = 0;
        priority_queue< tuple<long long, int, int> > pq;
        pq.push({0, i, 0});
        while (!pq.empty()) {
            auto [D, x, y] = pq.top(); pq.pop();
            D = -D;
            if (D != f[x][y]) continue;
            for (auto [a, b, c] : G[x]) {
                if (D + b < f[a][y ^ c]) {
                    f[a][y ^ c] = D + b;
                    pq.push({-f[a][y ^ c], a, y ^ c});
                }
            }
        }
        for (int j = 0; j < (1 << p); ++j) g[j] = min(g[j], f[i][j]);
    }
    for (int i = 1; i <= p; ++i) res[i] = 1e9;
    for (int i = 1; i < (1 << p); ++i) {
        for (int j = i; j; j = (j - 1) & i) g[i] = min(g[i], g[j] + g[i ^ j]);
        res[__builtin_popcount(i)] = min(res[__builtin_popcount(i)], g[i]);
    }
    for (int i = p - 1; i; --i) res[i] = min(res[i], res[i + 1]);
    for (int i = 1; i <= p; ++i) printf("%d\n", res[i]);
    return 0;
}