3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int MX = 200005;
int N, ip[MX];
vector<pair<int, int> > E[MX];
int fr, bk, que[MX], vst[MX], fa[MX], sz[MX], ok[MX], val[MX];
long long dis[MX];
int bestid = -1;
double ans = 1e20;
bool BFS(int st) {
  fr = bk = 0;
  que[bk++] = st;
  vst[st] = 1;
  fa[st] = st;
  dis[st] = 0;
  while (fr < bk) {
    int u = que[fr++];
    for (auto it : E[u]) {
      int v = it.first, w = it.second;
      if (!ok[v] || vst[v]) continue;
      que[bk++] = v;
      vst[v] = 1;
      dis[v] = dis[u] + w;
      fa[v] = u;
    }
  }
  for (int i = 0; i < bk; i++) {
    vst[que[i]] = 0;
  }
}
int findCentroid(int st) {
  int ret = -1, cost = 1029384756;
  BFS(st);
  for (int i = bk - 1; i >= 0; i--) {
    int u = que[i], mx = 0;
    sz[u] = 1;
    for (auto it : E[u]) {
      int v = it.first;
      if (!ok[v] || v == fa[u]) continue;
      sz[u] += sz[v];
      mx = max(mx, sz[v]);
    }
    mx = max(mx, bk - sz[u]);
    if (mx < cost) {
      cost = mx;
      ret = u;
    }
  }
  return ret;
}
double calcAnswer(int st) {
  double ret = 0;
  memset(dis, -1, sizeof(dis));
  fr = bk = 0;
  que[bk++] = st;
  dis[st] = 0;
  fa[st] = st;
  while (fr < bk) {
    int u = que[fr++];
    ret += dis[u] * sqrt(dis[u]) * ip[u];
    for (auto it : E[u]) {
      int v = it.first, w = it.second;
      if (dis[v] != -1) continue;
      fa[v] = u;
      dis[v] = dis[u] + w;
      que[bk++] = v;
    }
  }
  for (int i = bk - 1; i >= 0; i--) {
    int u = que[i];
    double tmp = sqrt(dis[u]) * ip[u];
    for (auto it : E[u]) {
      int v = it.first;
      if (v == fa[u]) continue;
      tmp += val[v];
    }
    val[u] = tmp;
  }
  return ret;
}
void go(int st) {
  int cent = findCentroid(st);
  ok[cent] = 0;
  double tmp = calcAnswer(cent);
  if (ans > tmp) {
    ans = tmp;
    bestid = cent;
  }
  int nxt = -1;
  for (auto it : E[cent]) {
    int v = it.first;
    if (!ok[v]) continue;
    if (nxt == -1 || val[v] > val[nxt]) {
      nxt = v;
    }
  }
  if (nxt != -1) {
    go(nxt);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> N;
  for (int i = 1; i <= N; i++) {
    cin >> ip[i];
  }
  for (int i = 2, u, v, w; i <= N; i++) {
    cin >> u >> v >> w;
    E[u].push_back(make_pair(v, w));
    E[v].push_back(make_pair(u, w));
  }
  for (int i = 1; i <= N; i++) {
    ok[i] = 1;
  }
  go(1);
  cout << bestid << " " << fixed << setprecision(10) << ans << endl;
  return 0;
}
