#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <string.h>
#define Nmax 1001
#define mp make_pair
#define f first
#define s second
#include <stdlib.h>
using namespace std;
vector <pair <int,int> > v[Nmax];
priority_queue<pair<int,pair<int,int> >, vector<pair<int,pair<int,int> > >, greater<pair<int,pair<int,int> > > > h;
int t[Nmax],viz[Nmax],a[Nmax][Nmax];
ifstream f("radiatie.in");
ofstream g("radiatie.out");
int n,b[Nmax][Nmax];
void df(int x)
{
    int i;
    for(i=1;i<=n;i++)
    {
        if(b[x][i]!=0&&viz[i]==0)
        {viz[i]=max(viz[x],b[x][i]);
        //cout<<i<<" ";
         //if(i==y) exit(0);
        df(i);}
    }
}
int main()
{
    int i,j,m,l,x,y,z,x1,y1,nod;
    f>>n>>m>>l;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        v[x].push_back(mp(y,z));
        v[y].push_back(mp(x,z));
        a[x][y]=z;
        a[y][x]=z;

    }
    //memset(cost,10, sizeof(cost));


    h.push(mp(0,mp(1,1)));
    while(!h.empty())
    {
        nod=h.top().s.s;
        if(t[nod]==0)
        {
            t[nod]=h.top().s.f  ;
            //cost[h.top().s.f]=h.top().f;
            h.pop();
            for(i=0;i<v[nod].size();++i)
            {
                if(t[v[nod][i].f]==0)
                {
                    h.push(mp(v[nod][i].s,mp(nod,v[nod][i].f)));
                }
            }

        }
        else h.pop();

    }
    for(i=2;i<=n;i++)
        b[t[i]][i]=b[i][t[i]]=a[t[i]][i];
    for(i=1;i<=l;i++)
    {
        f>>x>>y;
        viz[x]=1;
        df(x);
        g<<viz[y]<<'\n';
        //cout<<'\n';
        memset(viz,0,sizeof(viz));
    }
    return 0;
}