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 maxn = (int)2e5 + 100;
int e[maxn][2];
double ed[maxn];
bool restr[maxn];
vector<int> g[maxn];
double w[maxn];
int getOth(int id, int v) { return e[id][0] + e[id][1] - v; }
double getDer(int v, double len = 0., int par = -1) {
  double ans = pow(len, 0.5) * w[v];
  for (int i = 0; i < (int)g[v].size(); i++) {
    int eid = g[v][i];
    int nv = getOth(eid, v);
    if (nv == par) continue;
    ans += getDer(nv, len + ed[eid], v);
  }
  return ans;
}
double getSum(int v, double len = 0., int par = -1) {
  double ans = pow(len, 1.5) * w[v];
  for (int i = 0; i < (int)g[v].size(); i++) {
    int eid = g[v][i];
    int nv = getOth(eid, v);
    if (nv == par) continue;
    ans += getSum(nv, len + ed[eid], v);
  }
  return ans;
}
int cnt[maxn];
int getSize(int v, int par = -1) {
  cnt[v] = 1;
  for (int i = 0; i < (int)g[v].size(); i++) {
    int eid = g[v][i];
    int nv = getOth(eid, v);
    if (nv == par) continue;
    if (restr[eid]) continue;
    cnt[v] += getSize(nv, v);
  }
  return cnt[v];
}
int getCentr(int v, int gcnt, int par = -1) {
  for (int i = 0; i < (int)g[v].size(); i++) {
    int eid = g[v][i];
    int nv = getOth(eid, v);
    if (nv == par) continue;
    if (restr[eid]) continue;
    if (cnt[nv] * 2 > gcnt) return getCentr(nv, gcnt, v);
  }
  return v;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lf", &w[i]);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    double l;
    scanf("%d%d%lf", &a, &b, &l);
    a--;
    b--;
    e[i][0] = a;
    e[i][1] = b;
    ed[i] = l;
    g[a].push_back(i);
    g[b].push_back(i);
  }
  int root = 0;
  while (true) {
    int gcnt = getSize(root);
    if (gcnt == 1) break;
    root = getCentr(root, gcnt);
    double mx = 0;
    int mxid = -1;
    for (int i = 0; i < (int)g[root].size(); i++) {
      int eid = g[root][i];
      int nv = getOth(eid, root);
      if (restr[eid]) continue;
      double cur = getDer(nv, ed[eid], root);
      if (cur > mx) {
        mx = cur;
        mxid = eid;
      }
    }
    if (mxid == -1) break;
    42;
    int new_root = getOth(mxid, root);
    if (getSum(root) <= getSum(new_root)) break;
    root = new_root;
    restr[mxid] = true;
  }
  printf("%d %.10lf\n", root + 1, getSum(root));
  return 0;
}
