#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <utility>
#include <tuple>
using namespace std;

// Dinic を信じろ

template <typename CapTp=int, typename CostTp=int>
struct Edge {
    int to, rev;
    CapTp cap; CostTp cost;
    bool is_rev;
    Edge(int t, bool f, int r, CapTp ca, CostTp co=0)
        : to(t), rev(r), cap(ca), cost(co), is_rev(f) {}
};

template<typename CapTp=int>
struct Dinic {
    using Graph = vector< vector< Edge<CapTp> > >;
    Graph G;
    vector<int> level, iter;
    const CapTp IA;
    vector< pair<int, int> > r_edges;
    Dinic(int N, CapTp IA_=1<<29) : IA(IA_) {
        G.resize(N);
        level.resize(N);
        iter.resize(N);
    }
    void add_edge(int from, int to, CapTp cap) {
        G[from].emplace_back(to, false, G[to].size(), cap);
        G[to].emplace_back(from, true, G[from].size() - 1, 0);
        r_edges.emplace_back(to, G[to].size() - 1);
    }
    CapTp get_flowed_cap(size_t k) {
        if(r_edges.size() <= k) return -1;
        int v, i; tie(v, i) = r_edges[k];
        return G[v][i].cap;
    }
    void bfs(int s) {
        fill(level.begin(), level.end(), -1);
        queue<int> que; que.push(s);
        level[s] = 0;
        while(!que.empty()) {
            int temp = que.front(); que.pop();
            for(size_t i=0; i<G[temp].size(); i++) {
                auto &e = G[temp][i];
                if(e.cap > 0 && level[e.to] < 0) {
                    level[e.to] = level[temp] + 1;
                    que.push(e.to);
                }
            }
        }
    }
    CapTp dfs(int v, int t, CapTp f) {
        if(v == t) return f;
        for(int &i = iter[v]; i<(int)G[v].size(); i++) {
            auto &e = G[v][i];
            if(e.cap > 0 && level[v] < level[e.to]) {
                CapTp d = dfs(e.to, t, min(f, e.cap));
                if(d > 0) {
                    e.cap -= d;
                    G[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }
    CapTp max_flow(int s, int t) {
        CapTp flow = 0.0, f;
        while(1) {
            bfs(s);
            if(level[t] < 0) return flow;
            fill(iter.begin(), iter.end(), 0);
            while( (f = dfs(s, t, IA)) > 0 ) flow += f;
        }
    }
};

// 最小流量制約付きフロー
// u から v に最小 lb, 最大 ub 流す
template<typename flow_type>
struct Dinic_lr {
    Dinic<flow_type> fl;
    int S, T;
    flow_type sum_lb;

    Dinic_lr() {}
    Dinic_lr(int N) : fl(N+2, 0), S(N), T(N+1), sum_lb(0) {}

    void add_edge(int u, int v, flow_type lb, flow_type ub) {
        assert(0 <= lb && lb <= ub);
        if(u == v || ub == 0) return;
        fl.add_edge(u, v, ub - lb);
        fl.add_edge(S, v, lb);
        fl.add_edge(u, T, lb);
        sum_lb += lb;
    }

    flow_type max_flow(int s, int t) {
        flow_type a = fl.max_flow(S, T);
        flow_type b = fl.max_flow(s, T);
        flow_type c = fl.max_flow(S, t);
        flow_type d = fl.max_flow(s, t);
        return (a + c == sum_lb && a + b == sum_lb) ? b + d : -1;
    }
};


int solve_testcase() {
    int N, M, L; cin >> N >> M >> L;
    if(N == 0 and M == 0 and L == 0) return 1;
    
    const int INF = 1 << 29;
    vector< vector<int> > D(N, vector<int>(N, INF));
    for(int i=0; i<N; i++) D[i][i] = 0;

    for(int i=0; i<M; i++) {
        int u, v, d; cin >> u >> v >> d;
        D[u][v] = D[v][u] = d;
    }

    for(int k=0; k<N; k++) {
        for(int i=0; i<N; i++) {
            for(int j=0; j<N; j++) {
                D[i][j] = min(D[i][j], D[i][k] + D[k][j]);
            }
        }
    }

    vector< pair<int, int> > order;
    for(int i=0; i<L; i++) {
        int p, t; cin >> p >> t;
        order.emplace_back(t, p);
    }
    sort(order.begin(), order.end());

    Dinic<int> fl(L*2 + 2);
    int source = L*2, sink = source + 1;
    for(int i=0; i<L; i++) {
        fl.add_edge(source, i, 1);
        fl.add_edge(L+i, sink, 1);
    }
    for(int i=0; i<L; i++) {
        for(int j=i+1; j<L; j++) {
            int t1 = order[i].first, t2 = order[j].first;
            int p1 = order[i].second, p2 = order[j].second;
            int d = D[p1][p2];
            if(t1 + d <= t2) {
                // fprintf(stderr, "i = %d, j = %d\n", i, j);
                fl.add_edge(i, L+j, 1);
            }
        }
    }
    cout << L - fl.max_flow(source, sink) << endl;
    return 0;
}

int main() {
    while(!solve_testcase());
    return 0;
}



Measured memory_bytes: 31788