#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 i128;
typedef array<int,3> tr;
const int N = 110,M = 10,E = 1e4+10,INF = 1e9;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}
//
int m,n,_;
ll xp[M],yp[M],x[N],y[N]; 
vector<tr> e[N];

int g[1<<M],dp[1<<M];

int dis[N][1<<M],vis[N][1<<M],ans[M+1];
priority_queue<tr> pq;

mt19937 rnd(0);
int gen(int L,int R){
    return rnd()%(R-L+1)+L;
}

int dx,dy;
void F(ll& x,ll& y){
    ll vx = x,vy = y;
    x = vx*dx - vy*dy;
    y = vx*dx + vy*dy;
}

int main(){
    cin>>m>>n>>_;
    dx = gen(-1e6,1e6),dy = gen(-1e6,1e6);
    for(int i=0;i<m;i++)cin>>xp[i]>>yp[i],F(xp[i],yp[i]);
    for(int i=1;i<=n;i++)cin>>x[i]>>y[i],F(x[i],y[i]);
    fill(ans+1,ans+1+m,INF);
    fill(g,g+(1<<m),INF);
    fill(dp,dp+(1<<m),INF);

    for(int i=1,u,v,w;i<=_;i++){
        cin>>u>>v>>w;
        if(x[u] > x[v])swap(u,v);
        if(x[u] == x[v])continue;
        int to = 0;
        for(int j=0;j<m;j++){
            if(xp[j] < x[u] || xp[j] >= x[v])continue;
            if(xp[j] == x[u]){
                to |= (yp[j] > y[u])<<j;
                continue;
            }
            if((i128)(yp[j]-y[u]) * (x[v]-xp[j]) > (i128)(y[v]-yp[j]) * (xp[j]-x[u]))to |= 1<<j;
        }
        END:;
        e[u].push_back({v,w,to});
        e[v].push_back({u,w,to});
    }

    for(int s=1;s<=n;s++){
        for(int x=1;x<=n;x++){
            fill(dis[x],dis[x]+(1<<m),INF);
            fill(vis[x],vis[x]+(1<<m),0);
        }
        dis[s][0] = 0; pq.push((tr){0,s,0});
        while(pq.size()){
            tr now = pq.top(); pq.pop();
            int x = now[1],S = now[2]; if(vis[x][S])continue;
            vis[x][S] = 1;
            for(auto [y,w,to] : e[x]){
                int T = S^to;
                if(dis[y][T] > dis[x][S] + w){
                    dis[y][T] = dis[x][S] + w;
                    pq.push((tr){-dis[y][T],y,T});
                }
            }
        }
        for(int S=0;S<(1<<m);S++)tomin(g[S],dis[s][S]);
    }
    dp[0] = 0;
    for(int S=0;S<(1<<m);S++){
        for(int T=S;T;T=(T-1)&S){
            tomin(dp[S],dp[S^T] + g[T]);
        }
        int pcnt = __builtin_popcount(S);
        tomin(ans[pcnt],dp[S]);
    }
    for(int i=m-1;i>=1;i--)tomin(ans[i],ans[i+1]);
    for(int i=1;i<=m;i++)cout<<ans[i]<<endl;

    return 0;
}