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;
template <typename T>
void cmin(T &x, const T &y) {
  if (y < x) x = y;
}
template <typename T>
void cmax(T &x, const T &y) {
  if (y > x) x = y;
}
template <typename T>
void read(T &x) {
  x = 0;
  char c = getchar();
  bool f = 0;
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-') f = 1, c = getchar();
  while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
  if (f) x = -x;
}
int n;
double val[MX];
int fst[MX], nxt[MX * 2], v[MX * 2], w[MX * 2], lnum;
void addeg(int nu, int nv, int nw) {
  nxt[++lnum] = fst[nu];
  fst[nu] = lnum;
  v[lnum] = nv;
  w[lnum] = nw;
}
void input() {
  read(n);
  for (int i = 1; i <= n; i++) read(val[i]);
  for (int i = 1; i < n; i++) {
    int a, b, c;
    read(a), read(b), read(c);
    addeg(a, b, c);
    addeg(b, a, c);
  }
}
int siz[MX], msiz[MX], cen;
bool ban[MX];
pair<double, int> ans(1e28, 0);
void gsize(int x, int f) {
  siz[x] = 1, msiz[x] = 0;
  for (int i = fst[x]; i; i = nxt[i]) {
    int y = v[i];
    if (!ban[y] && y != f) {
      gsize(y, x);
      siz[x] += siz[y];
      cmax(msiz[x], siz[y]);
    }
  }
}
void gcent(int x, int f, int s) {
  cmax(msiz[x], s - siz[x]);
  if (!cen || msiz[x] < msiz[cen]) cen = x;
  for (int i = fst[x]; i; i = nxt[i]) {
    int y = v[i];
    if (!ban[y] && y != f) gcent(y, x, s);
  }
}
double calc(int x, int f, int d, double p) {
  double ret = pow(d, p) * val[x];
  for (int i = fst[x]; i; i = nxt[i])
    if (v[i] != f) ret += calc(v[i], x, d + w[i], p);
  return ret;
}
int divide(int x) {
  gsize(x, 0);
  gcent(x, 0, siz[x]);
  x = cen;
  ban[x] = 1;
  double der = calc(x, 0, 0, 0.5);
  cmin(ans, make_pair(calc(x, 0, 0, 1.5), x));
  for (int i = fst[x]; i; i = nxt[i]) {
    if (ban[v[i]]) continue;
    double sub = calc(v[i], x, w[i], 0.5);
    if (sub > der - sub) return divide(v[i]);
  }
  return x;
}
int main() {
  input();
  divide(1);
  printf("%d %.8lf\n", ans.second, ans.first);
  return 0;
}
