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;
bool SR(int &_x) { return scanf("%d", &_x) == 1; }
bool SR(long long &_x) { return scanf("%" PRId64, &_x) == 1; }
bool SR(double &_x) { return scanf("%lf", &_x) == 1; }
bool SR(char *_s) { return scanf("%s", _s) == 1; }
bool RI() { return true; }
template <typename I, typename... T>
bool RI(I &_x, T &..._tail) {
  return SR(_x) && RI(_tail...);
}
void SP(const int _x) { printf("%d", _x); }
void SP(const long long _x) { printf("%" PRId64, _x); }
void SP(const double _x) { printf("%.16lf", _x); }
void SP(const char *s) { printf("%s", s); }
void PL() { puts(""); }
template <typename I, typename... T>
void PL(const I _x, const T... _tail) {
  SP(_x);
  if (sizeof...(_tail)) putchar(' ');
  PL(_tail...);
}
const int maxn = 2e5 + 5;
int n, w[maxn];
vector<pair<int, int> > edge[maxn];
void read() {
  RI(n);
  for (int i = (1); i <= int(n); i++) RI(w[i]);
  for (int i = 0; i < int(n - 1); i++) {
    int a, b, l;
    RI(a, b, l);
    edge[a].push_back(make_pair(b, l));
    edge[b].push_back(make_pair(a, l));
  }
}
bitset<maxn> del;
int par[maxn], siz[maxn];
int dfs2(int u, int p) {
  par[u] = p;
  siz[u] = 1;
  for (auto v : edge[u])
    if (!del[v.first] && v.first != p) siz[u] += dfs2(v.first, u);
  return siz[u];
}
void dfs3(int u, int &ans, int &bw, const int &ful) {
  int me = ful - siz[u];
  for (auto v : edge[u])
    if (!del[v.first] && v.first != par[u])
      dfs3(v.first, ans, bw, ful), me = max(me, siz[v.first]);
  if (me < bw) bw = me, ans = u;
}
double dfs4(int u, int p, long long dis) {
  double ans = w[u] * sqrt(dis);
  for (auto e : edge[u])
    if (e.first != p) ans += dfs4(e.first, u, dis + e.second);
  return ans;
}
void dfs5(int u, int p) {
  del[u] = 1;
  for (auto e : edge[u])
    if (e.first != p) dfs5(e.first, u);
}
void dfs1(int u) {
  dfs2(u, 0);
  int tmp = siz[u];
  dfs3(u, u, tmp, siz[u]);
  dfs2(u, 0);
  if (siz[u] <= 2) return;
  vector<double> dlt;
  for (auto e : edge[u]) dlt.push_back(dfs4(e.first, u, e.second));
  double sum = 0;
  for (auto x : dlt) sum += x;
  int pi = -1, lo = sum;
  for (int i = 0; i < int(((int)(dlt).size())); i++)
    if (sum - 2 * dlt[i] < lo) lo = sum - 2 * dlt[i], pi = i;
  if (lo >= 0) {
    del.set();
    del[u] = 0;
    return;
  }
  for (int i = 0; i < int(((int)(dlt).size())); i++)
    if (i != pi) dfs5(edge[u][i].first, u);
  dfs1(u);
}
void build() { dfs1(1); }
double dfs6(int u, int p, long long dis) {
  double ans = w[u] * dis * sqrt(dis);
  for (auto e : edge[u])
    if (e.first != p) ans += dfs6(e.first, u, dis + e.second);
  return ans;
}
void sol() {
  int u = 1;
  double ans = dfs6(1, 0, 0);
  for (int i = (1); i <= int(n); i++)
    if (!del[i]) {
      ;
      double cur = dfs6(i, 0, 0);
      if (cur < ans) ans = cur, u = i;
    }
  PL(u, ans);
}
int main() {
  read();
  build();
  sol();
  return 0;
}
