#include <iostream>

#include <cstdio>

#include <sstream>

#include <cstring>

#include <map>

#include <set>

#include <vector>

#include <stack>

#include <queue>

#include <algorithm>

#include <cmath>

#define rap(i, a, n) for(int i=a; i<=n; i++)

#define MOD 2018

#define LL long long

#define ULL unsigned long long

#define Pair pair<int, int>

#define mem(a, b) memset(a, b, sizeof(a))

#define _  ios_base::sync_with_stdio(0),cin.tie(0)

//freopen("1.txt", "r", stdin);

using namespace std;

const int maxn = , INF = 0x7fffffff;

const int maxm = 1e6 + ;

int n, m, cnt1, cnt2, c;

int head1[maxn], head2[maxn], f[maxn], d[maxn], vis[maxn];

int res[maxm];

struct node

{

    int v, w, next;

}Node[maxn*];

struct edge

{

    int v, id, next;

}Edge[maxm*];

void add1_(int u, int v, int w)

{

    Node[cnt1].v = v;

    Node[cnt1].w = w;

    Node[cnt1].next = head1[u];

    head1[u] = cnt1++;

}

void add1(int u, int v, int w)

{

    add1_(u, v, w);

    add1_(v, u, w);

}

void add2_(int u, int v, int id)

{

    Edge[cnt2].v = v;

    Edge[cnt2].id = id;

    Edge[cnt2].next = head2[u];

    head2[u] = cnt2++;

}

void add2(int u, int v, int id)

{

    add2_(u, v, id);

    add2_(v, u, id);

}

int find(int x)

{

    return f[x]==x?x:(f[x] = find(f[x]));

}

int lca(int u, int deep, int root)

{

    f[u] = u;

    d[u] = deep;

    vis[u] = root;  // 标记属于的树

    for(int i=head1[u]; i!=-; i=Node[i].next)

    {

        node e = Node[i];

        if(vis[e.v] == -)

        {

            lca(e.v, deep+e.w, root);

            f[e.v] = u;

        }

    }

    for(int i=head2[u]; i!=-; i=Edge[i].next)

    {

        edge e = Edge[i];

        if(vis[e.v] == root)   //判断另一个结点是不是和u属于一个树

        {

            int k = find(e.v);  //寻找最近公共祖先

            res[e.id] = d[u] + d[e.v] - *d[k];

        }

    }

}

void init()

{

    mem(head1, -);

    mem(head2, -);

    mem(res, -);

    mem(vis, -);

    cnt1 = cnt2 = ;

}

int main()

{

    while(scanf("%d%d%d", &n, &m, &c) != EOF)

    {

        init();

        rap(i, , m)

        {

            int u, v, w;

            scanf("%d%d%d", &u, &v, &w);

            add1(u, v, w);

        }

        rap(i, , c)

        {

            int u, v;

            scanf("%d%d", &u, &v);

            add2(u, v, i);

        }

        rap(i, , n)

            if(vis[i] == -)

                lca(i, , i);

        rap(i, , c)

        {

            if(res[i] == -) printf("Not connected\n");

            else printf("%d\n", res[i]);

        }

    }

    return ;

}