#include <bits/stdc++.h>
using namespace std;
const int maxn = 10010;
int n, m, k, tot;
int g[1010][1010], deg[maxn];
int bel[maxn], first[maxn], id[maxn], d[maxn], dep[maxn];
int opt[maxn * 10][20], ln[maxn];
double r[maxn], Cx[maxn], Cy[maxn];
double x[maxn], y[maxn];
double dis(int i, int j) {
  return sqrt(((Cx[i] - Cx[j]) * (Cx[i] - Cx[j])) +
              ((Cy[i] - Cy[j]) * (Cy[i] - Cy[j])));
}
void dfs(int x, int Dep) {
  tot++;
  dep[x] = d[tot] = Dep;
  id[tot] = x;
  first[x] = tot;
  for (int i = 1; i <= m; i++)
    if (g[x][i]) {
      dfs(i, Dep + 1);
      tot++;
      id[tot] = x;
      d[tot] = Dep;
    }
}
void ST() {
  int m = ln[tot];
  for (int j = 0; j <= m; j++)
    for (int i = 1; i <= tot; i++)
      if (i + (1 << j) - 1 <= tot) {
        if (j == 0) {
          opt[i][j] = id[i];
          continue;
        }
        int x = opt[i][j - 1];
        int y = opt[i + (1 << (j - 1))][j - 1];
        if (dep[x] < dep[y])
          opt[i][j] = x;
        else
          opt[i][j] = y;
      }
}
int Lca(int a, int b) {
  int x = min(first[a], first[b]);
  int y = max(first[a], first[b]);
  int k = ln[y - x + 1];
  int i = opt[x][k];
  int j = opt[y - (1 << k) + 1][k];
  return dep[i] < dep[j] ? i : j;
}
int main() {
  ln[1] = 0;
  for (int i = 2; i <= 10000; i++) ln[i] = ln[i - 1] + ((i & (i - 1)) == 0);
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
  for (int i = 1; i <= m; i++) cin >> r[i] >> Cx[i] >> Cy[i];
  memset(g, 0, sizeof(g));
  r[0] = 1000000001;
  for (int i = 1; i <= m; i++) {
    int x = 0;
    for (int j = 1; j <= m; j++) {
      if (i == j) continue;
      if (dis(i, j) > r[i] + r[j]) continue;
      if (r[i] < r[j] && r[j] < r[x]) x = j;
    }
    g[x][i] = 1;
  }
  for (int i = 1; i <= n; i++) {
    bel[i] = 0;
    for (int j = 1; j <= m; j++) {
      double dis = sqrt(((x[i] - Cx[j]) * (x[i] - Cx[j])) +
                        ((y[i] - Cy[j]) * (y[i] - Cy[j])));
      if (dis < r[j] && r[j] < r[bel[i]]) bel[i] = j;
    }
  }
  dfs(0, 1);
  ST();
  for (int i = 1; i <= k; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a = bel[a];
    b = bel[b];
    int x = Lca(a, b);
    printf("%d\n", dep[a] + dep[b] - dep[x] * 2);
  }
  return 0;
}
